Pages that link to "Item:Q2294625"

The following pages link to Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625):

Displaying 11 items.

• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• An iterated local search for the traveling salesman problem with release dates and completion time minimization (Q1651639) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
• Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling (Q3114668) (← links)
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem (Q5689145) (← links)
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem (Q6113360) (← links)
• MILP models of a patient transportation problem (Q6661215) (← links)