Every longest Hamiltonian path in even n-gons

DOI10.1142/S1793830912500577zbMATH Open1257.05080MaRDI QIDQ4903643FDOQ4903643

Authors: Blanca Isabel Niel 

Publication date: 24 January 2013

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

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

zbMATH Keywords

Hamiltonian pathextremal problemstraveling salesman problemEuclidean geometric problemfurthest neighbor tours

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The traveling salesman problem. A computational study.

Cited In (3)

• Title not available (Why is that?)
• 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

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)