Pages that link to "Item:Q2482754"

The following pages link to An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754):

Displaying 16 items.

• Time-dependent routing problems: a review (Q342083) (← links)
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
• A way to optimally solve a time-dependent vehicle routing problem with time windows (Q1002083) (← links)
• An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
• Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
• A time-dependent hierarchical Chinese postman problem (Q2303339) (← 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)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← 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)
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows (Q2815434) (← links)
• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem (Q6568425) (← links)