PDC-algorithms and intractable combinatorial optimization problems
Abstract
Based on the analysis of PDC-algorithms for intractable combinatorial optimization problems, general principles of their building are formulated and generalizations about increasing the effectiveness of their using are given. A possibility of constructing new PDC-algorithms on the basis of the existed ones is analyzed.Downloads
Published
2009-09-25
Issue
Section
Theoretical and applied problems and methods of system analysis