Pages that link to "Item:Q2935106"
From MaRDI portal
The following pages link to Analysis of the single-vehicle cyclic inventory routing problem (Q2935106):
Displaying 13 items.
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← links)
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem (Q342382) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← 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)
- An exact approach for cyclic inbound inventory routing in a level production system (Q2294631) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
- An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing (Q2792910) (← links)
- Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system (Q2798528) (← 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)
- Stochastic inventory routing with time-based shipment consolidation (Q6106772) (← links)
