A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs.
Thomas R. StidsenKim Allan AndersenBernd DammannPublished in: Manag. Sci. (2014)
Keyphrases
- branch and bound algorithm
- set covering problem
- lagrangian relaxation
- bi objective
- lower bound
- mixed integer program
- branch and bound
- optimal solution
- upper bound
- np hard
- search tree
- test problems
- combinatorial optimization
- multi objective
- single machine scheduling problem
- feasible solution
- efficient solutions
- precedence constraints
- cutting plane
- neural network
- linear programming
- lower and upper bounds
- multiple objectives
- multi objective optimization
- shortest path problem
- dynamic programming
- network design
- mixed integer
- knapsack problem
- simulated annealing