Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities

DOI10.1007/978-3-540-72792-7_34zbMath1136.90408OpenAlexW1575115745MaRDI QIDQ5429286

Retsef Levi, M. I. Sviridenko, Andrea Lodi

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_34

zbMATH Keywords

integer programmingapproximation algorithmsrandomized algorithmspolyhedral combinatoricsscheduling theory and algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (7)

Capacitated Arc Stabbing ⋮ A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints ⋮ Primal-Dual Schema for Capacitated Covering Problems ⋮ LP-Based Algorithms for Capacitated Facility Location ⋮ Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements ⋮ Multi-item lot-sizing with joint set-up costs ⋮ Primal-dual schema for capacitated covering problems

This page was built for publication: Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities