Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs.
Nicolas ForgetSune Lauth GadegaardLars Relund NielsenPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- branch and bound algorithm
- lower bound
- linear program
- multi objective
- branch and bound
- optimal solution
- linear programming
- upper bound
- objective function
- lower and upper bounds
- set covering problem
- np hard
- extreme points
- linear inequalities
- optimization algorithm
- randomly generated
- lower bounding
- evolutionary algorithm
- multiple objectives
- bi objective
- network flow
- mixed integer
- finite number
- worst case