scientific article; zbMATH DE number 4189491

zbMATH Open0721.90074MaRDI QIDQ5753758FDOQ5753758

Authors:

Publication date: 1987

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

Recommendations

• scientific article; zbMATH DE number 34438
• New classes of efficiently solvable generalized traveling salesman problems
• Publication:3030604
• scientific article; zbMATH DE number 4027206
• The traveling salesman problem on a graph and some related integer polyhedra

zbMATH Keywords

polynomial algorithmtravelling salesman4- vertex cyclesskew orderable networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38)

Cited In (12)

• A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
• The cone of Monge matrices: Extremal rays and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• Perspectives of Monge properties in optimization
• Special cases of the traveling salesman problem
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
• A comment on consecutive-2-out-of-\(n\) systems
• Four-point conditions for the TSP: the complete complexity classification

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