A polyhedral study of lot-sizing with supplier selection
From MaRDI portal
Publication:448963
DOI10.1016/J.DISOPT.2011.09.001zbMATH Open1247.90208OpenAlexW1982577425MaRDI QIDQ448963FDOQ448963
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
Recommendations
- On the polyhedral structure of two-level lot-sizing problems with supplier selection
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Inventory lot-sizing with supplier selection
- Facets and algorithms for capacitated lot sizing
Cites Work
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Production Planning by Mixed Integer Programming
- Graph Theory and Integer Programming
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Lower bounds in lot-sizing models: A polyhedral study
- Title not available (Why is that?)
- Valid inequalities for mixed 0-1 programs
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Flow pack facets of the single node fixed-charge flow polytope
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Facets and algorithms for capacitated lot sizing
- Uncapacitated lot-sizing: The convex hull of solutions
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Valid inequalities and separation for capacitated economic lot sizing
- Modelling piecewise linear concave costs in a tree partitioning problem
- Dynamic knapsack sets and capacitated lot-sizing
- The uncapacitated lot-sizing problem with sales and safety stocks
Cited In (7)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Valid inequalities for the single arc design problem with set-ups
- A study of the lot-sizing polytope
- An integrated model for lot sizing with supplier selection and quantity discounts
- A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers
- Impact analysis of flexibility on the integrated lot sizing and supplier selection problem
- Facets for the single node fixed-charge network set with a node set-up variable
This page was built for publication: A polyhedral study of lot-sizing with supplier selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448963)
