Lot-sizing on a tree

DOI10.1016/j.orl.2007.04.007zbMath1166.90372OpenAlexW2038337208MaRDI QIDQ924877

Marco Di Summa, Laurence A. Wolsey

Publication date: 29 May 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.04.007

zbMATH Keywords

scenario treelot-sizingmixing sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90)

Related Items

A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand, Single item lot-sizing with non-decreasing capacities, Stochastic lot sizing problem with nervousness considerations, Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty, Two-stage stochastic lot-sizing problem under cost uncertainty, Dynamic capacitated lot sizing with random demand and dynamic safety stocks, A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging, LS-LIB: A Library of Tools for Solving Production Planning Problems, A polyhedral study of the static probabilistic lot-sizing problem, Lot-sizing on a tree, Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem, Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure, A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales

Cites Work

• Lot-sizing on a tree
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• On formulations of the stochastic uncapacitated lot-sizing problem
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• The Mixing Set with Flows
• Sequential Pairing of Mixed Integer Inequalities
• The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
• Production Planning by Mixed Integer Programming
• Mixing mixed-integer inequalities