scientific article; zbMATH DE number 1535433

MaRDI QIDQ4515903zbMATH OpenFDO

Authors

Publication date 23 November 2000

zbMATH Keywords

polynomial time solvable special caseSupnick matrixtravelling salesman problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 992947
• The maximum travelling salesman problem on symmetric Demidenko matrices
• Relaxation of the polytope of the asymmetric travelling salesman problem on the basis of the cone of generalized Supnick's matrices
• Conditions for the strong solvability of optimization problems on permutations and their application.
• Maximum travelling salesman problem. I

Cited in

(3)

• scientific article; zbMATH DE number 992947 (Why is no real title available?)
• Relaxation of the polytope of the asymmetric travelling salesman problem on the basis of the cone of generalized Supnick's matrices
• Conditions for the strong solvability of optimization problems on permutations and their application.

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