Pages that link to "Item:Q4979996"
From MaRDI portal
The following pages link to Formulations for an inventory routing problem (Q4979996):
Displaying 36 items.
- Multi-period vehicle routing problem with due dates (Q337604) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
- The flexible periodic vehicle routing problem (Q1652351) (← links)
- The shared customer collaboration vehicle routing problem (Q1681166) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- The multi-sourcing location inventory problem with stochastic demand (Q1754058) (← links)
- Inventory routing with pickups and deliveries (Q1754327) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- Exact solution methods for the multi-period vehicle routing problem with due dates (Q2002858) (← links)
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
- A genetic algorithm for solving the inventory routing problem with time windows (Q2086696) (← links)
- Inventory routing in a warehouse: the storage replenishment routing problem (Q2140300) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- The inventory routing problem with demand moves (Q2226502) (← links)
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries (Q2242202) (← links)
- Coalition-formation problem for cooperative inventory routing game (Q2331485) (← links)
- An inventory-routing problem with the objective of travel time minimization (Q2514745) (← links)
- Modeling inventory routing problems in supply chains of high consumption products (Q2572875) (← links)
- An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- The inventory routing problem: the value of integration (Q2811934) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation (Q2980176) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- A Matheuristic for the Multivehicle Inventory Routing Problem (Q4599309) (← links)
- Iterated local search and simulated annealing algorithms for the inventory routing problem (Q4624897) (← links)
- (Q4962507) (← links)
- Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem (Q5356988) (← links)
- Systematic reviews as a metaknowledge tool: caveats and a review of available options (Q6056869) (← links)
- Complexity of inventory routing problems when routing is easy (Q6068536) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem (Q6164609) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)
- Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network (Q6555134) (← links)