Some relationships between lagrangian and surrogate duality in integer programming.
Mark H. KarwanRonald L. RardinPublished in: Math. Program. (1979)
Keyphrases
- integer programming
- lagrangian relaxation
- linear programming
- set covering problem
- duality gap
- np hard
- production planning
- column generation
- valid inequalities
- set covering
- cutting plane
- cutting plane algorithm
- network flow
- facility location
- constraint programming
- optimal solution
- ai planning
- transportation problem
- crew scheduling
- inference problems
- integer program
- feasible solution
- vehicle routing problem with time windows
- linear programming relaxation
- objective function
- mixed integer programming
- knapsack problem
- relaxation algorithm
- dual formulation
- linear program
- integer programming formulations