Heuristic for the Hamiltonian Path Problem in Euclidian Two Space

DOI10.2307/3009638zbMath0398.90101OpenAlexW4251979157MaRDI QIDQ4182282

Love, Robert F., John P. Norback

Publication date: 1979

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

Full work available at URL: https://doi.org/10.2307/3009638

zbMATH Keywords

HeuristicHamiltonian Path ProblemTwo DimensionalComputational ExperienceEuclidean DistancesTravelling Salesman Problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Related Items

Heuristics and their design: A survey, The traveling salesman problem: An overview of exact and approximate algorithms, Heuristic methods and applications: A categorized survey