Pages that link to "Item:Q5060801"
From MaRDI portal
The following pages link to Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801):
Displaying 9 items.
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791) (← links)
- (Q3080636) (← links)
- (Q5314401) (← links)
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
- A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows (Q6087498) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)