Accelerated primal-dual cutting plane algorithm for all-integer programming.
Parviz GhandforoushPublished in: Comput. Oper. Res. (1983)
Keyphrases
- primal dual
- cutting plane algorithm
- integer programming
- linear programming
- valid inequalities
- cutting plane
- linear program
- np hard
- interior point methods
- lagrangian relaxation
- approximation algorithms
- semidefinite programming
- convex optimization
- column generation
- variational inequalities
- convergence rate
- production planning
- feasible solution
- convex programming
- interior point
- optimal solution
- network flow
- linear programming relaxation
- set covering
- quadratic programming
- vehicle routing problem with time windows
- dynamic programming
- objective function
- integer program
- constraint programming
- set covering problem
- duality gap