Pages that link to "Item:Q1357488"
From MaRDI portal
The following pages link to Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (Q1357488):
Displaying 12 items.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems (Q2188765) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
