Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation

Cites Work

Unnamed Item
Primal-dual subgradient methods for convex problems
A joint replenishment inventory-location model
An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
A heuristic lagrangean algorithm for the capacitated plant location problem
Incorporating inventory and routing costs in strategic location models
Efficient algorithms for the capacitated concentrator location problem
An exact algorithm for the capacitated facility location problems with single sourcing
An efficient optimal solution method for the joint replenishment problem
The volume algorithm: Producing primal solutions with a subgradient method
A repeated matching heuristic for the single-source capacitated facility location problem
A heuristic algorithm for solving large location-inventory problems with demand uncertainty
Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation
Lagrangean heuristics for location problems
An inventory-location model: Formulation, solution algorithm and computational results
Assessing the environmental benefits of horizontal cooperation using a location-inventory model
Mitigating partial-disruption risk: a joint facility location and inventory model considering customers' preferences and the role of substitute products and backorder offers
A review of the joint replenishment problem literature: 1989--2005
An efficient optimal solution method for the joint replenishment problem with minimum order quantities
Two-echelon supply chain network design with trade credit
Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs
Efficient algorithms for the joint replenishment problem with minimum order quantities
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Capacitated warehouse location model with risk pooling
A simple improvement on Silver's heuristic for the joint replenishment problem
Warehouse-Retailer Network Design Problem
98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
Models and algorithms for the dynamic-demand joint replenishment problem
The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard
A Proximal Bundle Method with Approximate Subgradient Linearizations
Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies

This page was built for publication: Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation