Uncapacitated lot-sizing: The convex hull of solutions

DOI10.1007/BFB0121006zbMATH Open0551.90068OpenAlexW2107474910MaRDI QIDQ3343777FDOQ3343777

Authors: Tony J. van Roy, Laurence A. Wolsey, Imre Bárány 

Publication date: 1984

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121006

Recommendations

• Uncapacitated lot sizing with backlogging: the convex hull
• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
• Lot-sizing with fixed charges on stocks: the convex hull
• Uncapacitated Lot-Sizing Problems with Start-Up Costs
• The uncapacitated lot-sizing problem with sales and safety stocks

zbMATH Keywords

polyhedral theoryplant locationmixed integer programming formulationconvex hull of the solutionseconomic lot-sizing modellarge duality gap

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Cited In (73)

• Shortest paths, single origin‐destination network design, and associated polyhedra
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
• Two mixed integer programming formulations arising in manufacturing management
• Approximation algorithms for supply chain planning and logistics problems with market choice
• The convex hull of two core capacitated network design problems
• New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
• An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
• Valid inequalities and separation for uncapacitated fixed charge networks
• Extended formulations for stochastic lot-sizing problems
• A branch and bound method for stochastic integer problems under probabilistic constraints
• Packing and covering a tree by subtrees
• Single-item dynamic lot-sizing problems: an updated survey
• Integer-programming software systems
• A cutting plane approach to capacitated lot-sizing with start-up costs
• A computational analysis of lower bounds for big bucket production planning problems
• Uncapacitated two-level lot-sizing
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• A linear description of the discrete lot-sizing and scheduling problem
• On formulations of the stochastic uncapacitated lot-sizing problem
• Polyhedral techniques in combinatorial optimization I: Theory
• A polyhedral study of lot-sizing with supplier selection
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• MIP formulations and heuristics for two-level production-transportation problems
• Reformulation by discretization: application to economic lot sizing
• Relaxations for two-level multi-item lot-sizing problems
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• The uncapacitated lot-sizing problem with sales and safety stocks
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
• Two-stage stochastic lot-sizing problem under cost uncertainty
• Approximate extended formulations
• Convex hull results for generalizations of the constant capacity single node flow set
• Valid inequalities and separation for capacitated economic lot sizing
• Using separation algorithms to generate mixed integer model reformulations
• Modelling piecewise linear concave costs in a tree partitioning problem
• A study of the lot-sizing polytope
• Flow pack facets of the single node fixed-charge flow polytope
• A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Uncapacitated lot sizing with backlogging: the convex hull
• Lot-sizing with fixed charges on stocks: the convex hull
• Chvátal closures for mixed integer programming problems
• A heuristic approach for big bucket multi-level production planning problems
• Lot-sizing polyhedra with a cardinality constraint
• Lot sizing with inventory gains
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Optimal solutions for the cutting stock problem
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• A dual algorithm for the economic lot-sizing problem
• Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity
• Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
• Progress with single-item lot-sizing
• A polyhedral study of the static probabilistic lot-sizing problem
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Facets and algorithms for capacitated lot sizing
• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• A technique for speeding up the solution of the Lagrangean dual
• Strong formulations for mixed integer programming: A survey
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
• Multiechelon Lot Sizing: New Complexities and Inequalities
• LS-LIB: a library of tools for solving production planning problems
• Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
• A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
• Capacitated lot-sizing problem with outsourcing
• A branch-and-cut algorithm for an assembly routing problem
• Valid inequalities for separable concave constraints with indicator variables
• Lower bound on size of branch-and-bound trees for solving lot-sizing problem

This page was built for publication: Uncapacitated lot-sizing: The convex hull of solutions

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