Algorithms for Large-scale Travelling Salesman Problems

DOI10.1057/jors.1972.79zbMath0248.90039OpenAlexW1985278890MaRDI QIDQ5661324

Samuel Eilon, Nicos Christofides

Publication date: 1972

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1972.79

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

The vehicle routing problem with backhauls, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, Traveling salesman problem heuristics: leading methods, implementations and latest advances, A variable depth search branching, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, Vehicle Routing Problems with Inter-Tour Resource Constraints, The traveling salesman problem: An overview of exact and approximate algorithms, Sequential search and its application to vehicle-routing problems, A diagonal completion and 2-optimal procedure for the travelling salesman problem, An approach for solving a class of transportation scheduling problems, A Lagrangean heuristic for the maximal covering location problem, 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, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, An effective implementation of the Lin-Kernighan traveling salesman heuristic, A successful algorithm for solving directed Hamiltonian path problems, Tourenplanung für zwei Depots bei offenen Touren, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis