Pages that link to "Item:Q6096613"
From MaRDI portal
The following pages link to Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613):
Displaying 9 items.
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791) (← links)
- (Q3080636) (← links)
- (Q4715981) (← links)
- (Q5314401) (← links)
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)