Pages that link to "Item:Q2668692"
From MaRDI portal
The following pages link to An iterative matheuristic for the inventory routing problem (Q2668692):
Displaying 14 items.
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem (Q322976) (← links)
- On an iterative procedure for solving a routing problem with constraints (Q483197) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- A matheuristic for solving inventory sharing problems (Q2669710) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- A hybrid heuristic for an inventory routing problem (Q2815432) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- A multi-period inventory routing problem with procurement decisions: a case in China (Q6170693) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)
- Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network (Q6555134) (← links)
- New benchmark instances for the inventory routing problem (Q6555180) (← links)