Pages that link to "Item:Q1651554"
From MaRDI portal
The following pages link to An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554):
Displayed 12 items.
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← 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)
- Scheduling activities with time-dependent durations and resource consumptions (Q2140190) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← 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)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)