A polyhedral study of lot-sizing with supplier selection
From MaRDI portal
Publication:448963
DOI10.1016/j.disopt.2011.09.001zbMath1247.90208OpenAlexW1982577425MaRDI QIDQ448963
Publication date: 11 September 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2011.09.001
Related Items (3)
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ Facets for the single node fixed-charge network set with a node set-up variable ⋮ Valid inequalities for the single arc design problem with set-ups
Cites Work
- Unnamed Item
- Valid inequalities for mixed 0-1 programs
- Valid inequalities and separation for capacitated economic lot sizing
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Modelling piecewise linear concave costs in a tree partitioning problem
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Dynamic knapsack sets and capacitated lot-sizing
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Facets and algorithms for capacitated lot sizing
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Uncapacitated lot-sizing: The convex hull of solutions
- Graph Theory and Integer Programming
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Production Planning by Mixed Integer Programming
- The uncapacitated lot-sizing problem with sales and safety stocks
- Flow pack facets of the single node fixed-charge flow polytope
This page was built for publication: A polyhedral study of lot-sizing with supplier selection
