Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints

DOI10.1287/moor.2016.0830zbMath1371.90013OpenAlexW2592674913MaRDI QIDQ5359123

G. Massonnet, Jean-Philippe Gayon, Christophe Rapine, Gautier Stauffer

Publication date: 22 September 2017

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2016.0830

zbMATH Keywords

approximation algorithmslot sizingcombinatorial algorithmmulti-echelon inventory problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)

Related Items (2)

Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs

This page was built for publication: Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints