scientific article; zbMATH DE number 4016629

zbMATH Open0625.90091MaRDI QIDQ3028751FDOQ3028751

Authors: Vitali Oscarovich Groppen 

Publication date: 1987

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

Recommendations

• Graphical approach to combinatorial optimization
• Optimization of dynamic programming methods when solving extremal combinatorial problems
• The use of dynamic programming in genetic algorithms for permutation problems
• Sequential algorithm for the solution of problems of combinatorial optimization on permutations
• The principle of optimality in the design of efficient algorithms

zbMATH Keywords

weighted directed graphtravelling salesmanoptimal permutation of a finite set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited In (4)

• Graphical approach to combinatorial optimization
• A combinatorial structure ensuring applicability of the dynamic programming method
• Optimization of dynamic programming methods when solving extremal combinatorial problems
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems

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