Pages that link to "Item:Q5741450"
From MaRDI portal
The following pages link to A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems (Q5741450):
Displaying 7 items.
- An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930) (← links)
- An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
