Improved randomized approximation algorithms for lot-sizing problems

DOI10.1007/3-540-61310-2_27MaRDI QIDQ4645935zbMATH OpenOpenAlexFDO

Authors Chung-Piaw Teo, Dimitris Bertsimas

Publication date 11 January 2019

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

Full work available at URL https://doi.org/10.1007/3-540-61310-2_27

zbMATH Keywords

approximation algorithmjoint replenishment problemoptimal stationary policybase periodimprove approximation algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 1263278 (Why is no real title available?)
• .878-approximation algorithms for MAX CUT and MAX 2SAT
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
• Approximation Procedures for the One-Warehouse Multi-Retailer System
• Convex separable optimization is not much harder than linear optimization
• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems
• Lot Sizing Policies for Finite Production Rate Assembly Systems
• Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints
• Nonlinear formulations and improved randomized approximation algorithms for multicut problems
• Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
• Optimal Power-of-Two Replenishment Strategies in Capacitated General Production/Distribution Networks
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
• Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes

This page was built for publication: Improved randomized approximation algorithms for lot-sizing problems

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