Pages that link to "Item:Q337612"
From MaRDI portal
The following pages link to An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem (Q337612):
Displaying 26 items.
- Multiple-vendor, multiple-retailer based vendor-managed inventory (Q271946) (← links)
- A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods (Q324315) (← links)
- A capacitated facility location and inventory management problem with single sourcing (Q331996) (← links)
- An integrated supply chain problem: a nested Lagrangian relaxation approach (Q492808) (← links)
- Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints (Q724317) (← links)
- A leagile inventory-location model: formulation and its optimisation (Q991856) (← links)
- Multi-source facility location-allocation and inventory problem (Q992677) (← links)
- A combined statistical selection procedure measured by the expected opportunity cost (Q1640622) (← links)
- Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints (Q1721497) (← links)
- Optimizing allocation in a warehouse network (Q1742223) (← links)
- A heuristic algorithm for solving large location-inventory problems with demand uncertainty (Q1751826) (← links)
- A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints (Q1754254) (← links)
- A blood bank network design problem with integrated facility location, inventory and routing decisions (Q2005956) (← links)
- Incorporating price-dependent demands into a multi-echelon closed-loop network considering the lost sales and backorders: a case study of wireless network (Q2129396) (← links)
- Modeling logistics service providers in a non-cooperative supply chain (Q2292350) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design (Q2393466) (← links)
- Integrating disassembly line balancing in the planning of a reverse logistics network from the perspective of a third party provider (Q2399324) (← links)
- Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs (Q2668783) (← links)
- A conic integer programming approach to stochastic joint location-inventory problems (Q2917632) (← links)
- A Lagrangian relaxation approach to multi-period inventory/distribution planning (Q3156543) (← links)
- Throughput optimization for the Robotic Cell Problem with Controllable Processing Times (Q4603940) (← links)
- A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
- Integrating supplier selection decisions into an inventory location problem for designing the supply chain network (Q6123377) (← links)
- An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks (Q6658358) (← links)
