Pages that link to "Item:Q1651554"

The following pages link to An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554):

Displaying 21 items.

• The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
• Perspectives on integer programming for time-dependent models (Q2001858) (← links)
• Rejoinder on: ``Perspectives on integer programming for time-dependent models'' (Q2001860) (← 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)
• Scheduling activities with time-dependent durations and resource consumptions (Q2140190) (← 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)
• 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)
• (Q3080636) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
• (Q5314401) (← links)
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
• Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem (Q6568425) (← links)
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)