scientific article
From MaRDI portal
Publication:3801366
zbMath0654.90091MaRDI QIDQ3801366
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Related Items
On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight ⋮ Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles ⋮ Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension ⋮ An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles ⋮ Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP ⋮ A better differential approximation ratio for symmetric TSP ⋮ On finding a cyclic tour and a vehicle loading plan yielding maximum profit