scientific article; zbMATH DE number 4189491

MaRDI QIDQ5753758zbMATH OpenFDO

Authors

Publication date 1987

zbMATH Keywords

4- vertex cyclespolynomial algorithmskew orderable networkstravelling salesman

Mathematics Subject Classification ID

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

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

Cited in

(12)

• A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
• Special cases of the traveling salesman problem
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
• Perspectives of Monge properties in optimization
• Four-point conditions for the TSP: the complete complexity classification
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis
• scientific article; zbMATH DE number 4018804 (Why is no real title available?)
• scientific article; zbMATH DE number 5819786 (Why is no real title available?)
• scientific article; zbMATH DE number 4083394 (Why is no real title available?)
• scientific article; zbMATH DE number 4108531 (Why is no real title available?)
• The cone of Monge matrices: Extremal rays and applications
• A comment on consecutive-2-out-of-n systems

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)