Pages that link to "Item:Q4030791"
From MaRDI portal
The following pages link to Fast Heuristics for Large Geometric Traveling Salesman Problems (Q4030791):
Displaying 16 items.
- Evolutionary algorithms for solving multi-objective travelling salesman problem (Q656058) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Quick updates for \(p\)-opt TSP heuristics (Q1198624) (← links)
- Vehicle routing with a sparse feasibility graph (Q1278726) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311) (← links)
- Provably good solutions for the traveling salesman problem (Q4698114) (← links)
- TRAVELING SALESMAN PROBLEM OF SEGMENTS (Q4818594) (← links)