Generalized pyramidal tours for the generalized traveling salesman problem

DOI10.1007/978-3-319-71150-8_23zbMath1470.90104OpenAlexW2769166639MaRDI QIDQ1699787

Katherine Neznakhina, Mikhail Yu. Khachay

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_23

zbMATH Keywords

pseudo-pyramidal tourquasi-pyramidal optimal tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] ⋮ Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters

This page was built for publication: Generalized pyramidal tours for the generalized traveling salesman problem