Branch-and-Bound for Bi-objective Integer Programming.
Sophie N. ParraghFabien TricoirePublished in: INFORMS J. Comput. (2019)
Keyphrases
- bi objective
- branch and bound
- integer programming
- optimal solution
- efficient solutions
- np hard
- lower bound
- search algorithm
- branch and bound algorithm
- multi objective
- linear programming
- set covering problem
- column generation
- upper bound
- search space
- network design
- knapsack problem
- ant colony optimization
- combinatorial optimization
- multi objective optimization
- network design problem
- multiple objectives
- tree search
- constraint programming
- linear programming relaxation
- objective function
- valid inequalities
- integer program
- nsga ii
- cutting plane
- production planning
- shortest path problem
- cutting plane algorithm
- lagrangian relaxation
- heuristic methods
- feasible solution
- worst case
- approximation algorithms
- set covering
- optimization algorithm
- search strategies
- particle swarm optimization
- scheduling problem
- linear program
- evolutionary algorithm