The one-warehouse multi-retailer problem: reformulation, classification, and computational results
From MaRDI portal
Publication:1761836
DOI10.1007/s10479-011-1022-0zbMath1259.90037OpenAlexW2041262336MaRDI QIDQ1761836
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-1022-0
Related Items
On reformulations for the one-warehouse multi-retailer problem ⋮ The production routing problem: a review of formulations and solution algorithms ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint ⋮ The dynamic-demand joint replenishment problem with approximated transportation costs ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ The warehouse-inventory-transportation problem for supply chains ⋮ MIP formulations and heuristics for two-level production-transportation problems ⋮ A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure ⋮ Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- Computational complexity of uncapacitated multi-echelon production planning problems
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
- A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs
- A Decomposition Algorithm for Arborescence Inventory Systems
- Single‐warehouse multi‐retailer inventory systems with full truckload shipments
- Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
