Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
From MaRDI portal
Publication:3168976
DOI10.1287/moor.1070.0305zbMath1231.90046OpenAlexW2097673705MaRDI QIDQ3168976
M. I. Sviridenko, Andrea Lodi, Retsef Levi
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1070.0305
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)
Related Items (16)
A Technique for Obtaining True Approximations for k-Center with Covering Constraints ⋮ Dynamic programming approximation algorithms for the capacitated lot-sizing problem ⋮ A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ LP-based approximation algorithms for capacitated facility location ⋮ Capacitated lot sizing problems with inventory bounds ⋮ Easy capacitated facility location problems, with connections to lot-sizing ⋮ Multi-item uncapacitated lot sizing problem with inventory bounds ⋮ Unnamed Item ⋮ Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities ⋮ Unnamed Item ⋮ A technique for obtaining true approximations for \(k\)-center with covering constraints
This page was built for publication: Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
