Automatic decomposition of mixed integer programs for lagrangian relaxation using a multiobjective approach.
Jake WeinerAndreas T. ErnstXiaodong LiYuan SunPublished in: GECCO (2020)
Keyphrases
- lagrangian relaxation
- mixed integer program
- multi objective
- feasible solution
- integer programming
- lower bound
- branch and bound algorithm
- linear programming
- lagrangian dual
- column generation
- np hard
- dynamic programming
- lower and upper bounds
- evolutionary algorithm
- multiple objectives
- valid inequalities
- objective function
- linear program
- mixed integer programming
- genetic algorithm
- optimal solution
- shortest path
- particle swarm optimization
- upper bound
- mixed integer
- probability distribution
- feature space