Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy.
Concepción DomínguezMartine LabbéAlfredo MarínPublished in: Comput. Oper. Res. (2022)
Keyphrases
- mixed integer
- lot sizing
- valid inequalities
- network design problem
- mixed integer linear programming
- facility location
- network flow problem
- mixed integer programming
- benders decomposition
- linear program
- cutting plane
- multistage
- convex hull
- feasible solution
- continuous relaxation
- continuous variables
- optimal solution
- lead time
- production planning
- routing problem
- linear programming
- np hard
- special case
- training data
- lagrangian heuristic