Valid inequalities and branch-and-cut for the clique pricing problem.
Géraldine HeilpornMartine LabbéPatrice MarcotteGilles SavardPublished in: Discret. Optim. (2011)
Keyphrases
- valid inequalities
- integer programming
- traveling salesman problem
- linear programming
- mixed integer programming
- mixed integer
- cutting plane algorithm
- cutting plane
- convex hull
- feasible solution
- mixed integer linear programs
- column generation
- lower and upper bounds
- network design problem
- linear programming relaxation
- integer program
- integer programming formulation
- primal dual
- facet defining inequalities
- facet defining
- continuous variables
- np hard
- lagrangian relaxation
- objective function
- lot sizing
- lower bound
- learning algorithm
- genetic algorithm