Branch-and-bound for bi-objective integer programming.
Sophie N. ParraghFabien TricoirePublished in: CoRR (2018)
Keyphrases
- bi objective
- branch and bound
- integer programming
- optimal solution
- efficient solutions
- np hard
- lower bound
- column generation
- multi objective
- set covering problem
- branch and bound algorithm
- search algorithm
- linear programming
- search space
- knapsack problem
- network design
- upper bound
- ant colony optimization
- multi objective optimization
- combinatorial optimization
- production planning
- nsga ii
- cutting plane
- lagrangian relaxation
- constraint programming
- tree search
- network design problem
- multiple objectives
- cutting plane algorithm
- shortest path problem
- linear programming relaxation
- set covering
- solution quality
- search strategies
- feasible solution
- integer program
- traveling salesman problem
- valid inequalities
- objective function
- combinatorial optimization problems
- linear program
- constraint satisfaction
- scheduling problem