Uncapacitated lot-sizing: The convex hull of solutions
From MaRDI portal
Publication:3343777
DOI10.1007/BFb0121006zbMath0551.90068OpenAlexW2107474910MaRDI QIDQ3343777
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
polyhedral theoryplant locationmixed integer programming formulationconvex hull of the solutionseconomic lot-sizing modellarge duality gap
Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Polytopes and polyhedra (52Bxx)
Related Items
Modelling piecewise linear concave costs in a tree partitioning problem, A linear description of the discrete lot-sizing and scheduling problem, Shortest paths, single origin‐destination network design, and associated polyhedra, A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers, Packing and covering a tree by subtrees, Lot-sizing with fixed charges on stocks: the convex hull, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Valid inequalities and separation for capacitated economic lot sizing, A cutting plane approach to capacitated lot-sizing with start-up costs, Polyhedral results on single node variable upper-bound flow models with allowed configurations, Strong formulations for mixed integer programming: A survey, Two-stage stochastic lot-sizing problem under cost uncertainty, Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection, Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs, Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity, Progress with single-item lot-sizing, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, Relaxations for two-level multi-item lot-sizing problems, A computational analysis of lower bounds for big bucket production planning problems, Single-item dynamic lot-sizing problems: an updated survey, LS-LIB: A Library of Tools for Solving Production Planning Problems, A polyhedral study of the static probabilistic lot-sizing problem, Improved lower bounds for the capacitated lot sizing problem with setup times., A polyhedral study of lot-sizing with supplier selection, Approximation algorithms for supply chain planning and logistics problems with market choice, Multiechelon Lot Sizing: New Complexities and Inequalities, Chvátal closures for mixed integer programming problems, A dual algorithm for the economic lot-sizing problem, Using separation algorithms to generate mixed integer model reformulations, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Reformulation by discretization: application to economic lot sizing, Lot sizing with inventory gains, Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure, Lot-sizing polyhedra with a cardinality constraint, A heuristic approach for big bucket multi-level production planning problems, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, The convex hull of two core capacitated network design problems, MIP formulations and heuristics for two-level production-transportation problems, An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, On formulations of the stochastic uncapacitated lot-sizing problem, Convex hull results for generalizations of the constant capacity single node flow set, A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure, Flow pack facets of the single node fixed-charge flow polytope, Extended formulations for stochastic lot-sizing problems, Capacitated lot-sizing problem with outsourcing, Uncapacitated two-level lot-sizing, A branch-and-cut algorithm for an assembly routing problem, Valid inequalities for separable concave constraints with indicator variables, Polyhedra for lot-sizing with Wagner-Whitin costs, Two mixed integer programming formulations arising in manufacturing management, A branch and bound method for stochastic integer problems under probabilistic constraints, Polyhedral techniques in combinatorial optimization I: Theory, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, Facets and algorithms for capacitated lot sizing, Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds, Optimal solutions for the cutting stock problem, Lower bound on size of branch-and-bound trees for solving lot-sizing problem, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, Approximate extended formulations, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, Valid inequalities and separation for uncapacitated fixed charge networks, A technique for speeding up the solution of the Lagrangean dual, A new dynamic programming algorithm for the single item capacitated dynamic lot size model, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, Integer-programming software systems, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
