Pages that link to "Item:Q548680"
From MaRDI portal
The following pages link to Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680):
Displayed 7 items.
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP (Q2629574) (← links)