Heuristic for the Hamiltonian Path Problem in Euclidian Two Space

DOI10.2307/3009638zbMATH Open0398.90101OpenAlexW4251979157MaRDI QIDQ4182282FDOQ4182282

Authors: John P. Norback, Robert F. Love 

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 ProblemComputational ExperienceEuclidean DistancesTravelling Salesman ProblemsTwo Dimensional

Mathematics Subject Classification ID

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

Cited In (3)

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

This page was built for publication: Heuristic for the Hamiltonian Path Problem in Euclidian Two Space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182282)