Finding discrete global minima with a filled function for integer programming.
You-lin ShangLian-Sheng ZhangPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- integer programming
- global minima
- global minimum
- np hard
- linear programming
- production planning
- lagrangian relaxation
- constraint programming
- set covering problem
- network flow
- cutting plane algorithm
- set covering
- integer program
- cutting plane
- valid inequalities
- pairwise
- ai planning
- column generation
- facility location
- vehicle routing problem with time windows
- dynamic programming
- set partitioning
- energy minimization