scientific article; zbMATH DE number 4083394

MaRDI QIDQ3813626zbMATH OpenFDO

Authors A. I. Serdyukov

Publication date 1985

zbMATH Keywords

polynomial algorithmsestimatestravelling salesman

Mathematics Subject Classification ID

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

Recommendations

• A polynomial algorithm for a constrained traveling salesman problem
• Publication:5753758
• scientific article; zbMATH DE number 34438
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• Approximation Polynomial Algorithms for Some Modifications of TSP
• Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
• scientific article; zbMATH DE number 1131767
• scientific article; zbMATH DE number 5819786
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Applications of a special polynomial class of TSP

Cited in

(8)

• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 4108531 (Why is no real title available?)
• scientific article; zbMATH DE number 5819786 (Why is no real title available?)
• Approximation Polynomial Algorithms for Some Modifications of TSP
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• Traveling salesman-based curve reconstruction in polynomial time
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• scientific article; zbMATH DE number 6007907 (Why is no real title available?)

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