The following pages link to (Q4715981):
Displaying 33 items.
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← 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)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← 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 (Q1850351) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← 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)
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← 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)
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791) (← links)
- An integer programming approach for the time-dependent TSP (Q2883581) (← links)
- (Q3080636) (← links)
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216) (← links)
- Time‐dependent traveling salesman problem–the deliveryman case (Q4712107) (← links)
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows (Q4849335) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
- The traveling salesman problem with cumulative costs (Q5287441) (← links)
- Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem (Q5689145) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
