A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
From MaRDI portal
Publication:1878999
DOI10.1007/s10288-003-0026-2zbMath1078.90510OpenAlexW1817886451MaRDI QIDQ1878999
Publication date: 22 September 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://dblp.uni-trier.de/db/journals/4or/4or2.html#Vyve04
Related Items
The Mixing Set with Divisible Capacities, Improved lower bounds for the capacitated lot sizing problem with setup times., Compact formulations as a union of polyhedra, The mixing-MIR set with divisible capacities, Mixing MIR inequalities with two divisible coefficients, Exploring relaxation induced neighborhoods to improve MIP solutions, Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, A compact formulation of a mixed-integer set, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs, The mixing set with divisible capacities: a simple approach, Approximate extended formulations
Uses Software
