New formulations and valid inequalities for a bilevel pricing problem.
Sophie DewezMartine LabbéPatrice MarcotteGilles SavardPublished in: Oper. Res. Lett. (2008)
Keyphrases
- valid inequalities
- linear programming
- integer programming
- feasible solution
- cutting plane algorithm
- traveling salesman problem
- linear program
- linear programming relaxation
- primal dual
- column generation
- mixed integer linear programs
- mixed integer
- cutting plane
- mixed integer programming
- integer programming formulation
- lower and upper bounds
- convex hull
- network design problem
- dynamic programming
- np hard
- lagrangian relaxation
- objective function
- optimal solution
- integer program
- lower bound
- transportation problem
- upper bound
- evolutionary algorithm
- network flow
- special case
- probabilistic model
- facet defining inequalities