Finding multiplies solutions for non-linear integer programming.
José Manuel Jiménez CobanoJosé María Ucha-EnríquezPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- integer programming
- np hard
- integer programming formulations
- linear programming
- ai planning
- production planning
- column generation
- lagrangian relaxation
- cutting plane
- constraint programming
- cutting plane algorithm
- network flow
- facility location
- inference problems
- set covering
- benchmark problems
- integer program
- optimal solution
- np complete
- vehicle routing problem with time windows
- exact methods
- set covering problem
- crew scheduling
- lower bound
- lp relaxation
- branch and bound algorithm
- solution quality
- dantzig wolfe decomposition