Algorithms for Large-scale Travelling Salesman Problems
From MaRDI portal
Cited in
(20)- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- The vehicle routing problem with backhauls
- The traveling salesman problem: An overview of exact and approximate algorithms
- An approach for solving a class of transportation scheduling problems
- A Lagrangean heuristic for the maximal covering location problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- Future paths for integer programming and links to artificial intelligence
- Heuristic methods and applications: A categorized survey
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Sequential search and its application to vehicle-routing problems
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- Vehicle Routing Problems with Inter-Tour Resource Constraints
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- A variable depth search branching
- A diagonal completion and 2-optimal procedure for the travelling salesman problem
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
- A speed-up for Helsgaun's TSP heuristic by relaxing the positive gain criterion
- A successful algorithm for solving directed Hamiltonian path problems
- Tourenplanung für zwei Depots bei offenen Touren
This page was built for publication: Algorithms for Large-scale Travelling Salesman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661324)
