Branch-and-Bound for Biobjective Mixed-Integer Linear Programming.
Nathan AdelgrenAkshay GuptePublished in: INFORMS J. Comput. (2022)
Keyphrases
- branch and bound
- mixed integer linear programming
- branch and bound algorithm
- set covering problem
- bi objective
- lower bound
- search algorithm
- efficient solutions
- multi objective
- optimal solution
- column generation
- upper bound
- search space
- combinatorial optimization
- multi objective optimization
- search tree
- ant colony optimization
- tree search
- multiple objectives
- mathematical programming
- network design
- knapsack problem
- max sat
- search strategies
- cutting plane
- lagrangian relaxation
- objective function
- depth first search
- cost function
- np hard
- heuristic methods