Pages that link to "Item:Q613510"
From MaRDI portal
The following pages link to Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510):
Displaying 13 items.
- A survey of recent research on location-routing problems (Q296678) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
- Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- The consistent vehicle routing problem with heterogeneous fleet (Q2669772) (← links)
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem (Q6164375) (← links)
