Pyramidal tours for the traveling salesman

DOI10.1080/02331939408843938zbMath0819.90125OpenAlexW2044980763MaRDI QIDQ4764887

Richard H. Warren

Publication date: 5 September 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843938

zbMATH Keywords

polynomial timetraveling salesman problemsoptimal pyramidal tourtour improvement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Paths and cycles (05C38)

Related Items (2)

A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY

Cites Work

• Pyramidal tours and the traveling salesman problem
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
• Special cases of travelling salesman problems and heuristics
• Universal conditions for algebraic travelling salesman problems to be efficiently solvable

This page was built for publication: Pyramidal tours for the traveling salesman