Polyhedra for lot-sizing with Wagner-Whitin costs
From MaRDI portal
Publication:1804648
DOI10.1007/BF01582225zbMath0822.90049OpenAlexW2046269316MaRDI QIDQ1804648
Laurence A. Wolsey, Yves Pochet
Publication date: 11 June 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582225
Applications of mathematical programming (90C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items
Single item lot-sizing with non-decreasing capacities, Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales, A cross entropy algorithm for the Knapsack problem with setups, Lot-sizing with fixed charges on stocks: the convex hull, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Analysis of bounds for a capacitated single-item lot-sizing problem, A cutting plane approach to capacitated lot-sizing with start-up costs, On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs, Two-stage stochastic lot-sizing problem under cost uncertainty, An exact solution approach for the inventory routing problem with time windows, Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs, On a class of mixed-integer sets with a single integer variable, 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, Multi-stage simultaneous lot-sizing and scheduling for flow line production, The Mixing Set with Divisible Capacities, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, A note on the split rank of intersection cuts, Compact formulations as a union of polyhedra, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Lot sizing with minimum order quantity, A perfect information lower bound for robust lot-sizing problems, Lot sizing with inventory gains, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, Extended formulations in combinatorial optimization, A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing, A heuristic approach for big bucket multi-level production planning problems, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, Mixing MIR inequalities with two divisible coefficients, MIP formulations and heuristics for two-level production-transportation problems, The one-warehouse multi-retailer problem: reformulation, classification, and computational results, Extended formulations in combinatorial optimization, Campaign planning in time-indexed model formulations, Lot-sizing with production and delivery time windows, Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity, On formulations of the stochastic uncapacitated lot-sizing problem, Extended formulations for stochastic lot-sizing problems, Uncapacitated two-level lot-sizing, A branch-and-cut algorithm for an assembly routing problem, A maritime inventory routing problem: Discrete time formulations and valid inequalities, Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs, Multi-item lot-sizing with joint set-up costs, Uncapacitated lot sizing with backlogging: the convex hull, Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs, Comparative approaches to equipment scheduling in high volume factories, Single item lot sizing problems, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Approximate extended formulations
Cites Work
- Unnamed Item
- Unnamed Item
- Lot-size models with backlogging: Strong reformulations and cutting planes
- A dual algorithm for the economic lot-sizing problem
- Lot-sizing polyhedra with a cardinality constraint
- Uncapacitated lot-sizing: The convex hull of solutions
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
