Branch and bound approach for marking optimization problem of weighted marked graphs.
Leila ToursiNathalie SauerPublished in: SMC (2) (2004)
Keyphrases
- branch and bound
- combinatorial optimization
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- optimal solution
- search space
- branch and bound procedure
- upper bound
- beam search
- tree search
- weighted graph
- mini bucket
- graph theory
- optimization problems
- optimization algorithm
- branch and bound method
- depth first search
- lagrangian heuristic
- mathematical programming
- linear programming relaxation
- search strategies
- tree decomposition
- branch and bound search
- np hard
- max sat
- spanning tree
- approximation algorithms
- network design problem
- optimal configuration
- traveling salesman problem
- tree search algorithm
- neural network