Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth.
David CoudertDorian MazauricNicolas NissePublished in: SEA (2014)
Keyphrases
- branch and bound algorithm
- experimental evaluation
- lower bound
- branch and bound
- randomly generated
- upper bound
- np hard
- optimal solution
- lower bounding
- combinatorial optimization
- precedence constraints
- test problems
- lagrangian relaxation
- single machine scheduling problem
- search tree
- randomly generated problems
- upper bounding
- mixed integer linear programming
- maximum clique
- variable ordering
- branch and bound method
- integer variables
- finding an optimal solution
- neural network
- np complete