Pages that link to "Item:Q1302598"
From MaRDI portal
The following pages link to Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour (Q1302598):
Displaying 14 items.
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Extended neighborhood: Definition and characterization (Q1764249) (← links)
- On the neighborhood structure of the traveling salesman problem generated by local search moves (Q2468271) (← links)
- A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
- On the theoretical properties of swap multimoves (Q2643800) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- Local search with an exponential neighborhood for the servers load balancing problem (Q5264767) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
