Pages that link to "Item:Q2414451"

The following pages link to Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451):

Displaying 16 items.

• 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)
• 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)
• 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)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
• (Q3080636) (← links)
• A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)