Algorithmic aspects of pyramidal tours with restricted jump-backs

DOI10.4036/IIS.2001.123MaRDI QIDQ2780957zbMATH OpenOpenAlexFDO

Authors Yoshiaki Oda, Katsuhiro Ota

Publication date 2001

Published in Interdisciplinary Information Sciences (IIS) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4036/iis.2001.123

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Pyramidal tours with step-backs and the asymmetric traveling salesman problem
• Pyramidal tours and the traveling salesman problem
• Pyramidal tours for the traveling salesman
• A polynomial algorithm for a constrained traveling salesman problem
• On vertex adjacencies in the polytope of pyramidal tours with step-backs

Cited in

(5)

• An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
• Crane scheduling in railway yards: an analysis of computational complexity
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
• Minimizing the makespan on a single machine subject to modular setups
• An asymmetric analogue of van der Veen conditions and the traveling salesman problem

This page was built for publication: Algorithmic aspects of pyramidal tours with restricted jump-backs

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