A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
We consider a well-known NP-hard deterministic inventory control problem: the One-
Warehouse Multi-Retailer (OWMR) problem. We present a simple combinatorial algorithm to …
Warehouse Multi-Retailer (OWMR) problem. We present a simple combinatorial algorithm to …
Fast approximation algorithms for the One-Warehouse Multi-Retailer problem under general cost structures and capacity constraints
We consider a well-studied multi-echelon (deterministic) inventory control problem, known in
the literature as the one-warehouse multi-retailer (OWMR) problem. We propose a simple …
the literature as the one-warehouse multi-retailer (OWMR) problem. We propose a simple …
Modeling and solution of some multi-period supply chain optimization problems
W Hu - 2016 - repository.gatech.edu
This thesis consists of three parts, each of which contributes to an independent topic in the
broad area of multi-period supply chain optimization, and provides modeling and solution …
broad area of multi-period supply chain optimization, and provides modeling and solution …
Algorithmes d'approximation pour la gestion de stock
G Massonnet - 2013 - theses.hal.science
Nous considérons des problèmes de gestion des stocks multi-échelon à temps périodique
avec des demandes non stationnaires. Ces hypothèses sur la demande apparaissent …
avec des demandes non stationnaires. Ces hypothèses sur la demande apparaissent …
Principles of Supply Chain Management and Their Implications
J Muckstadt - Springer
Managing complex supply chain systems efficiently and effectively is essential for the
operational and financial success of companies. In particular, the fiows of material …
operational and financial success of companies. In particular, the fiows of material …
Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem
G Stauffer - Mathematical Methods of Operations Research, 2018 - Springer
In this paper, we consider k-echelon extensions of the deterministic one warehouse multi-
retailer problem. We give constant factor approximation algorithms for some of these …
retailer problem. We give constant factor approximation algorithms for some of these …
Decomposition‐based approximation algorithms for the one‐warehouse multi‐retailer problem with concave batch order costs
W Hu, Z Yu, A Toriello… - Naval Research Logistics …, 2020 - Wiley Online Library
We study the one‐warehouse multi‐retailer problem under deterministic dynamic demand
and concave batch order costs, where order batches have an identical capacity and the …
and concave batch order costs, where order batches have an identical capacity and the …
[PDF][PDF] Decomposition-based approximation algorithms for the one-warehouse multi-retailer problem with concave batch order costs
We study the one-warehouse multi-retailer (OWMR) problem under deterministic dynamic
demand and concave batch order costs, where order batches have an identical capacity and …
demand and concave batch order costs, where order batches have an identical capacity and …
[PDF][PDF] The One-Warehouse Multi-Retailer Problem with Four Types of Emission Constraints
J Liu - 2019 - biblos.hec.ca
In this thesis, we address the one-warehouse-multi-retailer (OWMR) problem. We consider a
plant that produces a single type of product and replenishes multiple retailers with dynamic …
plant that produces a single type of product and replenishes multiple retailers with dynamic …
Material and Cash Flow in Two-Tier Supply Chain with Trade Credits and Defaults
We develop a supply chain finance and inventory model to understand how trade credit
terms affect a firm's financing costs and inventory decision along the supply chain. In …
terms affect a firm's financing costs and inventory decision along the supply chain. In …