Pages that link to "Item:Q2815432"
From MaRDI portal
The following pages link to A hybrid heuristic for an inventory routing problem (Q2815432):
Displaying 14 items.
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)
- A relax‐and‐price heuristic for the inventory‐location‐routing problem (Q5246829) (← links)
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem (Q5356988) (← links)
- A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains (Q5884367) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- The consistent production routing problem (Q6064169) (← links)
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery (Q6087075) (← links)
- On the zero-inventory-ordering policy in the inventory routing problem (Q6087504) (← links)
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands (Q6088245) (← links)
- Adaptive evolutionary algorithms for portfolio selection problems (Q6088765) (← links)
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands (Q6090498) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- A multi-period inventory routing problem with procurement decisions: a case in China (Q6170693) (← links)
- New benchmark instances for the inventory routing problem (Q6555180) (← links)
