scientific article; zbMATH DE number 4053381

MaRDI QIDQ3789367zbMATH OpenFDO

Authors Jayme L. Szwarcfiter

Publication date 1987

zbMATH Keywords

digraphminimal cost Hamilton cyclepolynomial complexity

Mathematics Subject Classification ID

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

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

(16)

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

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)