scientific article

zbMATH Open0662.90084MaRDI QIDQ3813626FDOQ3813626

A. I. Serdyukov

Publication date: 1985

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

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)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

   Recommendations

• A polynomial algorithm for a constrained traveling salesman problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems 👍 👎
• Applications of a special polynomial class of TSP 👍 👎

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)