Pages that link to "Item:Q320683"
From MaRDI portal
The following pages link to The traveling salesman problem with time-dependent service times (Q320683):
Displaying 8 items.
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- Scheduling activities with time-dependent durations and resource consumptions (Q2140190) (← links)
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
