Suscripción a Biblioteca: Guest
Journal of Automation and Information Sciences

Publicado 12 números por año

ISSN Imprimir: 1064-2315

ISSN En Línea: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Principles of Designing PDC Algorithms for Intractable Combinatorial Problems

Volumen 29, Edición 2-3, 1997, pp. 36-40
DOI: 10.1615/JAutomatInfScien.v29.i2-3.70
Get accessGet access

SINOPSIS

A new approach to constructing efficient exact algorithms for hard combinatorial problems is suggested. Concepts of a PDC problem and a PDC algorithm (algorithm that contains both polynomial and decompositional components) are introduced.

Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones Precios y Políticas de Suscripcione Begell House Contáctenos Language English 中文 Русский Português German French Spain