scientific article; zbMATH DE number 218798

MaRDI QIDQ4694401zbMATH OpenFDO

Authors Vladimir Dimitrijević, Milosavljević, Milan, Dragoš Cvetković

Publication date 11 August 1993

zbMATH Keywords

bandwidth-limited digraphbranch and boundmultipartite graphsnon-standard traveling salesmansurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On Some Generalizations of the Travelling-Salesman Problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• A new generalization of the traveling salesman problem
• scientific article; zbMATH DE number 1855663
• The traveling salesman problem and its variations
• The traveling salesman problem and its variations
• On the approximability of the traveling salesman problem (extended abstract)
• Some Applications of the Generalized Travelling Salesman Problem
• On the solution of traveling salesman problems

Cited in

(5)

• Solving the k-best traveling salesman problem
• On the solution of the problem of the sequential traversing of sets using a ``nonclosed traveling salesman problem.
• Non-Euclidean Traveling Salesman Problem
• scientific article; zbMATH DE number 4116325 (Why is no real title available?)
• The traveling salesman problem: the spectral radius and the length of an optimal tour

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