Pages that link to "Item:Q2174903"
From MaRDI portal
The following pages link to Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903):
Displaying 12 items.
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows (Q2783791) (← links)
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231) (← links)
- (Q4715981) (← links)
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows (Q5240195) (← 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)
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
