A Bounding Minimization Problem for Primal Integer Programming.
Larry R. ArnoldMandell BellmorePublished in: Oper. Res. (1974)
Keyphrases
- integer programming
- linear programming
- objective function
- linear program
- np hard
- primal dual
- upper bound
- network flow
- column generation
- integer program
- ai planning
- support vector
- constraint programming
- set covering
- cutting plane
- valid inequalities
- production planning
- inference problems
- lagrangian relaxation
- feasible solution
- facility location
- crew scheduling
- set covering problem
- vehicle routing problem with time windows
- transportation problem
- optimal solution
- linear programming relaxation
- convex functions
- np complete
- optimization problems
- lower bound
- cutting plane algorithm