Pages that link to "Item:Q1068008"
From MaRDI portal
The following pages link to Methods for routing with time windows (Q1068008):
Displaying 16 items.
- A school bus scheduling problem (Q439545) (← links)
- The school bus routing problem: a review (Q1039772) (← links)
- Vehicles scheduling with sliding time windows (Q1120470) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- Visiting a network of services with time constraints. (Q1413815) (← links)
- Time-dependent routing (Q1651552) (← links)
- School-bus routing for program scheduling (Q1823853) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Data mining-based dispatching system for solving the local pickup and delivery problem (Q2393491) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
- A Heuristic Algorithm for Multi-Period Delivery Planning Problems (Q3494695) (← links)
- Routing with time windows by column generation (Q3688124) (← links)
- Vehicle routing and scheduling with time windows (Q3712128) (← links)
- Comparison of dynamic routeing techniques for automated guided vehicle system (Q4399078) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
