An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
From MaRDI portal
Publication:337612
DOI10.1016/J.COR.2014.03.006zbMATH Open1348.90387OpenAlexW1986517752WikidataQ59166646 ScholiaQ59166646MaRDI QIDQ337612FDOQ337612
Authors: Olga Battaïa, Dima Nazzal, Ali Diabat 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://oatao.univ-toulouse.fr/20100/1/Diabat_20100.pdf
Recommendations
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation
- Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints
- Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints
- A relax-and-price heuristic for the inventory-location-routing problem
- A Lagrangian relaxation approach to multi-period inventory/distribution planning
- A conic integer programming approach to stochastic joint location-inventory problems
- A heuristic algorithm for solving large location-inventory problems with demand uncertainty
- Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Cites Work
- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- An inventory-location model: Formulation, solution algorithm and computational results
- Warehouse-Retailer Network Design Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
- Efficient solution of large scale, single-source, capacitated plant location problems
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Facility location in supply chain design
- Plant location with minimum inventory
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- A continuous approximation approach for the integrated facility-inventory allocation problem
- Production/distribution system design with inventory considerations
- Capacitated warehouse location model with risk pooling
- Planning and coordination of production and distribution facilities for multiple commodities
- The optimal and heuristic solutions of a distribution network
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
Cited In (26)
- Multiple-vendor, multiple-retailer based vendor-managed inventory
- A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints
- An integrated supply chain problem: a nested Lagrangian relaxation approach
- A Lagrangian relaxation approach to multi-period inventory/distribution planning
- A leagile inventory-location model: formulation and its optimisation
- Integrating disassembly line balancing in the planning of a reverse logistics network from the perspective of a third party provider
- Incorporating price-dependent demands into a multi-echelon closed-loop network considering the lost sales and backorders: a case study of wireless network
- Throughput optimization for the robotic cell problem with controllable processing times
- A combined statistical selection procedure measured by the expected opportunity cost
- Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs
- Optimizing allocation in a warehouse network
- A capacitated facility location and inventory management problem with single sourcing
- A conic integer programming approach to stochastic joint location-inventory problems
- Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints
- Lagrangian relaxation of the generic materials and operations planning model
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation
- Multi-source facility location-allocation and inventory problem
- An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
- A blood bank network design problem with integrated facility location, inventory and routing decisions
- Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints
- A heuristic algorithm for solving large location-inventory problems with demand uncertainty
- A relax-and-price heuristic for the inventory-location-routing problem
- Integrating supplier selection decisions into an inventory location problem for designing the supply chain network
- Modeling logistics service providers in a non-cooperative supply chain
Uses Software
This page was built for publication: An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337612)
