Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
From MaRDI portal
Publication:5322130
DOI10.1287/opre.1050.0223zbMath1165.90304OpenAlexW2129547304MaRDI 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
Related Items (24)
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 ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ An exact solution approach for the inventory routing problem with time windows ⋮ Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Finding Optimal Refueling Policies in Transportation Networks ⋮ Learning optimal solutions via an LSTM-optimization framework ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Capacitated lot sizing problems with inventory bounds ⋮ An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs ⋮ A linear-time algorithm for finding optimal vehicle refueling policies ⋮ Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds ⋮ Two-level lot-sizing with inventory bounds ⋮ Multi-item uncapacitated lot sizing problem with inventory bounds ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Convex hull results for generalizations of the constant capacity single node flow set ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times ⋮ Four equivalent lot-sizing models ⋮ The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity ⋮ 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 ⋮ Minimum concave cost flow over a grid network
This page was built for publication: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
