The Capacitated Arc Routing Problem: Valid Inequalities and Facets.
José-Manuel BelenguerEnrique BenaventPublished in: Comput. Optim. Appl. (1998)
Keyphrases
- valid inequalities
- facet defining inequalities
- facet defining
- integer programming
- lower and upper bounds
- traveling salesman problem
- mixed integer programming
- mixed integer
- linear programming
- feasible solution
- cutting plane
- column generation
- randomly generated problems
- cutting plane algorithm
- convex hull
- linear programming relaxation
- mixed integer linear programs
- integer programming formulation
- integer program
- primal dual
- lagrangian relaxation
- network design problem
- integer programming problems
- lower bound
- continuous variables
- capacitated fixed charge
- upper bound
- production planning
- lot sizing
- combinatorial optimization
- objective function