On solving the Lagrangian dual of integer programs via an incremental approach.
Manlio GaudiosoGiovanni GiallombardoGiovanna MiglionicoPublished in: Comput. Optim. Appl. (2009)
Keyphrases
- integer program
- lagrangian dual
- linear program
- cutting plane algorithm
- column generation
- cutting plane
- integer programming
- lagrangian relaxation
- linear programming relaxation
- linear programming
- valid inequalities
- dual variables
- network flow
- branch and bound
- lp relaxation
- set covering
- linear programming problems
- dynamic programming
- support vector
- primal dual
- constraint satisfaction
- particle swarm optimization
- special case