Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs
From MaRDI portal
Publication:2780957
DOI10.4036/IIS.2001.123zbMath1050.90029OpenAlexW2014228178MaRDI QIDQ2780957
Publication date: 2001
Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4036/iis.2001.123
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Minimizing the makespan on a single machine subject to modular setups ⋮ Crane scheduling in railway yards: an analysis of computational complexity ⋮ An asymmetric analogue of van der Veen conditions and the traveling salesman problem ⋮ Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] ⋮ An asymmetric analog of van der Veen conditions and the traveling salesman problem. II
This page was built for publication: Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs