Pages that link to "Item:Q337420"
From MaRDI portal
The following pages link to A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420):
Displaying 29 items.
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem (Q342382) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition (Q948651) (← links)
- The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- Inventory routing with pickups and deliveries (Q1754327) (← links)
- Data-driven assignment of delivery patterns with handling effort considerations in retail (Q1782198) (← links)
- Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem (Q1947215) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (Q2242202) (← links)
- Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints (Q2285897) (← links)
- Coalition-formation problem for cooperative inventory routing game (Q2331485) (← links)
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem (Q2336751) (← links)
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) (← links)
- A variable neighborhood search for the multi-product inventory routing problem (Q2840757) (← links)
- Scenario tree-based heuristics for stochastic inventory-routing problems (Q2901065) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- A HEURISTIC ALGORITHM FOR THE DETERMINISTIC MULTI-PRODUCT INVENTORY SYSTEM WITH CAPACITY CONSTRAINT (Q3982630) (← links)
- A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
- (Q4962507) (← links)
- Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← links)
- (Q5285191) (← links)
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem (Q5356988) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands (Q6088245) (← links)
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands (Q6090498) (← links)
- Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19 (Q6168576) (← links)
- Vehicle routing problems with multiple commodities: a survey (Q6572828) (← links)
- Inventory reallocation in a fashion retail network: a matheuristic approach (Q6572901) (← links)