Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming.
Yifan XuChunli LiuDuan LiPublished in: J. Glob. Optim. (2005)
Keyphrases
- integer programming
- lagrangian relaxation
- valid inequalities
- set partitioning
- integer program
- cutting plane algorithm
- column generation
- np hard
- linear programming
- lp relaxation
- linear programming relaxation
- integer programming formulations
- dantzig wolfe decomposition
- cutting plane
- facility location
- constraint programming
- set covering
- network flow
- optimal solution
- set covering problem
- ai planning
- production planning
- lagrange multipliers
- vehicle routing problem with time windows
- transportation problem
- quadratic programming
- mixed integer programming
- support vector
- search algorithm
- special case
- relaxation algorithm
- inference problems
- feasible solution
- network design problem