Every longest Hamiltonian path in even n-gons

DOI10.1142/S1793830912500577MaRDI QIDQ4903643zbMATH OpenFDO

Authors Blanca Isabel Niel

Publication date 24 January 2013

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830912500577

zbMATH Keywords

Euclidean geometric problemextremal problemsfurthest neighbor toursHamiltonian pathtraveling salesman problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Geometry of the Euclidean Hamiltonian suboptimal and optimal paths in the \(\mathcal{N}(K_n(\root n \of {1}), (d_{ij})_{n\times n})\)'s networks
• Winding indexes of max. and min. Hamiltonians in N-gons
• scientific article; zbMATH DE number 1827998
• scientific article; zbMATH DE number 4073022
• Finding a shortest Hamiltonian path inside a simple polygon

Cites work

• scientific article; zbMATH DE number 3155900 (Why is no real title available?)
• The traveling salesman problem. A computational study.

Cited in

(3)

• Winding indexes of max. and min. Hamiltonians in N-gons
• scientific article; zbMATH DE number 1827998 (Why is no real title available?)
• Geometry of the Euclidean Hamiltonian suboptimal and optimal paths in the \(\mathcal{N}(K_n(\root n \of {1}), (d_{ij})_{n\times n})\)'s networks

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Every longest Hamiltonian path in even \(n\)-gons

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