Heuristic for the Hamiltonian Path Problem in Euclidian Two Space

DOI10.2307/3009638MaRDI QIDQ4182282zbMATH OpenOpenAlexFDO

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

Computational ExperienceEuclidean DistancesHamiltonian Path ProblemHeuristicTravelling Salesman ProblemsTwo Dimensional

Mathematics Subject Classification ID

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

Cited in

(3)

• Heuristics and their design: A survey
• The traveling salesman problem: An overview of exact and approximate algorithms
• Heuristic methods and applications: A categorized 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)