Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

DOI10.1287/opre.1050.0223zbMath1165.90304MaRDI QIDQ5322130

Simge Küçükyavuz, Atamtürk, Alper

Publication date: 18 July 2009

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

Full work available at URL: https://doi.org/10.1287/opre.1050.0223

Mathematics Subject Classification ID

90B05: Inventory, storage, reservoirs

Related Items

Multiechelon Lot Sizing: New Complexities and Inequalities, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Learning optimal solutions via an LSTM-optimization framework, The economic lot-sizing problem with perishable items and consumption order preference, A column generation-based heuristic algorithm for an inventory routing problem with perishable goods, Capacitated lot sizing problems with inventory bounds, Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, Four equivalent lot-sizing models, Single-item dynamic lot-sizing problems: an updated survey, Two-level lot-sizing with inventory bounds, Convex hull results for generalizations of the constant capacity single node flow set, Multi-item uncapacitated lot sizing problem with inventory bounds, A branch-and-cut algorithm for an assembly routing problem, The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity, Minimum concave cost flow over a grid network, A linear-time algorithm for finding optimal vehicle refueling policies, Dynamic lot-sizing model under perishability, substitution, and limited storage capacity, An exact solution approach for the inventory routing problem with time windows, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid, Scheduling two chains of unit jobs on one machine: A polyhedral study, Finding Optimal Refueling Policies in Transportation Networks