scientific article; zbMATH DE number 4053381

MaRDI QIDQ3789367zbMATH OpenFDO

Authors Jayme L. Szwarcfiter

Publication date 1987

zbMATH Keywords

polynomial complexitydigraphminimal cost Hamilton cycle

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 34438
• Many-visits TSP revisited
• The traveling salesman problem on a graph and some related integer polyhedra
• scientific article; zbMATH DE number 4027206
• Time- and space-optimal algorithm for the many-visits TSP

Cited in

(15)

• A time- and space-optimal algorithm for the many-visits TSP
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• The \(K\)th TSP is pseudopolynomial when TSP is polynomial
• Dynamic programming and the graphical traveling salesman problem
• Parameterized traveling salesman problem: beating the average
• How to survive while visiting a graph
• On the high multiplicity traveling salesman problem
• Time- and space-optimal algorithm for the many-visits TSP
• Many-visits TSP revisited
• On the Travelling Salesperson Problem in Many Dimensions
• Classifying traveling salesman problems
• An exact algorithm with linear complexity for a problem of visiting megalopolises
• The multi-stripe travelling salesman problem
• The travelling salesman and the PQ-tree.
• Optimal tour planning with specified nodes

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 Q3789367)