A study of the lot-sizing polytope

DOI10.1007/s10107-003-0465-8zbMath1073.90067OpenAlexW1664252374MaRDI QIDQ1881043

Atamtürk, Alper, Juan-Carlos Muñoz

Publication date: 27 September 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0465-8

zbMATH Keywords

polyhedral combinatoricslot-sizing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)

Related Items

Dynamic programming approximation algorithms for the capacitated lot-sizing problem, Single item lot-sizing with non-decreasing capacities, DASH: dynamic approach for switching heuristics, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, A computational analysis of lower bounds for big bucket production planning problems, Single-item dynamic lot-sizing problems: an updated survey, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems, Supermodularity and valid inequalities for quadratic optimization with indicators, Learning optimal solutions via an LSTM-optimization framework, LS-LIB: A Library of Tools for Solving Production Planning Problems, Multiechelon Lot Sizing: New Complexities and Inequalities, A heuristic approach for big bucket multi-level production planning problems, Optimizing over the split closure, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, A branch-and-cut algorithm for an assembly routing problem, Valid inequalities for separable concave constraints with indicator variables, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem