Lot-sizing on a tree

DOI10.1016/J.ORL.2007.04.007MaRDI QIDQ924877zbMATH OpenOpenAlexFDO

Authors 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

lot-sizingmixing setsscenario tree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 780785
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• On formulations of the stochastic uncapacitated lot-sizing problem
• A Lot-Sizing Problem on Trees, Related to Network Design
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Cites work

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

Cited in

(17)

• A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
• Stochastic lot sizing problem with nervousness considerations
• A polyhedral study of the static probabilistic lot-sizing problem
• Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem
• Dynamic capacitated lot sizing with random demand and dynamic safety stocks
• Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
• Lower bound on size of branch-and-bound trees for solving lot-sizing problem
• A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales
• LS-LIB: a library of tools for solving production planning problems
• A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
• Two-stage stochastic lot-sizing problem under cost uncertainty
• Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
• A Lot-Sizing Problem on Trees, Related to Network Design
• How to fit a tree in a box
• An approximate dynamic programming approach for multi-stage stochastic lot-sizing under a decision-hazard-decision information structure
• Single item lot-sizing with non-decreasing capacities
• Lot-sizing on a tree

This page was built for publication: Lot-sizing on a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924877)