Pages that link to "Item:Q4849335"
From MaRDI portal
The following pages link to An Optimal Algorithm for the Traveling Salesman Problem with Time Windows (Q4849335):
Displaying 15 items.
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
- An ant colony system approach for variants of the traveling salesman problem with time windows (Q3429053) (← links)
- A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows (Q5240195) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location (Q6065845) (← links)
- The intermittent travelling salesman problem (Q6066722) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- The first AI4TSP competition: learning to solve stochastic routing problems (Q6103656) (← links)
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)
