scientific article; zbMATH DE number 4068645

zbMATH Open0654.90091MaRDI QIDQ3801366FDOQ3801366

Authors: A. I. Serdyukov 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1985657
• scientific article
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
• Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
• scientific article; zbMATH DE number 706869

zbMATH Keywords

Euclidean travelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited In (11)

• An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
• Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
• A better differential approximation ratio for symmetric TSP
• 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 algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
• On finding a cyclic tour and a vehicle loading plan yielding maximum profit
• Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles

This page was built for publication:

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