Pages that link to "Item:Q4022935"
From MaRDI portal
The following pages link to On the Distance Constrained Vehicle Routing Problem (Q4022935):
Displayed 23 items.
- The school bus problem on trees (Q378249) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- The directed orienteering problem (Q547309) (← links)
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs (Q552454) (← links)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The close-open mixed vehicle routing problem (Q1926744) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities (Q4969270) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)