Pages that link to "Item:Q2783892"
From MaRDI portal
The following pages link to The Shortest Path Problem with Time Windows and Linear Waiting Costs (Q2783892):
Displaying 7 items.
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
- An assignment-based heuristic for vehicle routing with time windows (Q1001380) (← links)
- Multi-depot vehicle scheduling problems with time windows and waiting costs (Q1806860) (← links)
- Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
