The one-warehouse multi-retailer problem: reformulation, classification, and computational results

DOI10.1007/S10479-011-1022-0zbMATH Open1259.90037OpenAlexW2041262336MaRDI QIDQ1761836FDOQ1761836

Oğuz Solyalı, Haldun Süral

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

zbMATH Keywords

integer programminglot sizingstrong formulationsone-warehouse multi-retailer problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Production Planning by Mixed Integer Programming
• Computational complexity of uncapacitated multi-echelon production planning problems
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• Integrated Lot Sizing in Serial Supply Chains with Production Capacities
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
• Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
• Single‐warehouse multi‐retailer inventory systems with full truckload shipments
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
• A Decomposition Algorithm for Arborescence Inventory Systems
• 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

Cited In (16)

• The dynamic-demand joint replenishment problem with approximated transportation costs
• Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
• On reformulations for the one-warehouse multi-retailer problem
• The production routing problem: a review of formulations and solution algorithms
• A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• Single-item dynamic lot-sizing problems: an updated survey
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• The warehouse-inventory-transportation problem for supply chains
• MIP formulations and heuristics for two-level production-transportation problems
• Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
• A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
• The one-warehouse multiretailer problem with an order-up-to level inventory policy
• Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system
• A heuristic approach for the integrated production-transportation problem with process flexibility
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory

Recommendations

• Title not available (Why is that?) 👍 👎
• On reformulations for the one-warehouse multi-retailer problem 👍 👎
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem 👍 👎
• A new heuristic to solve the one-warehouse \(N\)-retailer problem 👍 👎
• Approximation Procedures for the One-Warehouse Multi-Retailer System 👍 👎
• A constant approximation algorithm for the one-warehouse multi-retailer problem 👍 👎
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem 👍 👎
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem 👍 👎
• Approximation algorithms for general one-warehouse multi-retailer systems 👍 👎
• Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints 👍 👎

This page was built for publication: The one-warehouse multi-retailer problem: reformulation, classification, and computational results

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