Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation.
Xiaoling SunDuan LiPublished in: Math. Oper. Res. (2000)
Keyphrases
- integer programming
- dual formulation
- worst case
- linear programming
- primal dual
- np hard
- total variation
- convex optimization
- valid inequalities
- column generation
- network flow
- integer program
- lagrangian relaxation
- duality gap
- production planning
- cutting plane
- iterative algorithms
- set covering problem
- ai planning
- constraint programming
- set covering
- dual variables
- approximation algorithms
- cutting plane algorithm
- integer programming formulations
- vehicle routing problem with time windows
- heuristic search
- higher order
- dynamic programming