The following pages link to (Q4715981):
Displaying 14 items.
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- The traveling purchaser problem with time-dependent quantities (Q1652259) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← 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)
- Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- An integer programming approach for the time-dependent TSP (Q2883581) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
