scientific article; zbMATH DE number 165534

MaRDI QIDQ4033292zbMATH OpenFDO

Authors L. E. Zabello, N. A. Yanushauskajte

Publication date 16 May 1993

zbMATH Keywords

Bellman optimality criterioncombinatorial problemcontinuous problemtransformation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 3924508
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• Linear complementarity as a general solution method to combinatorial problems
• Optimization of dynamic programming methods when solving extremal combinatorial problems
• Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method

Cited in

(5)

• Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
• scientific article; zbMATH DE number 3906254 (Why is no real title available?)
• scientific article; zbMATH DE number 3924508 (Why is no real title available?)
• scientific article; zbMATH DE number 49116 (Why is no real title available?)
• scientific article; zbMATH DE number 1263753 (Why is no real title available?)

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