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

DOI10.1007/978-3-540-72792-7_34MaRDI QIDQ5429286zbMATH OpenOpenAlexFDO

Authors Retsef Levi, Andrea Lodi, Maxim Sviridenko

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

randomized algorithmsinteger programmingapproximation algorithmspolyhedral combinatoricsscheduling theory and algorithms

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
• Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
• Constant approximation algorithm for non-uniform capacitated multi-item lot-sizing via strong covering inequalities
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups

Cited in

(13)

• Constant approximation algorithm for non-uniform capacitated multi-item lot-sizing via strong covering inequalities
• Primal-dual schema for capacitated covering problems
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• Weak flow cover inequalities for the capacitated facility location problem
• Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• Capacitated Arc Stabbing
• Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
• A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints
• Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
• LP-based algorithms for capacitated facility location
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429286)