๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

NP-Complete operations research problems and approximation algorithms

โœ Scribed by Peter Brucker

Book ID
105410065
Publisher
Springer
Year
1979
Tongue
English
Weight
979 KB
Volume
23
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

DNA Models and Algorithms for NP-Complet
DNA Models and Algorithms for NP-Complete Problems
โœ Eric Bach; Anne Condon; Elton Glaser; Celena Tanguay ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 488 KB

A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-coloring, which can only be run on small instances and, hence, are not practical. In this pape

New evolutionary genetic algorithms for
New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
โœ Fam Quang Bac; V. L. Perov ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 424 KB

Evolutionary genetic algorithms have been proposed to solve NP-complete combinatorial optimization problems. A new crossover operator based on group theory has been created. Computational processes motivated by proposed evolutionary genetic algorithms were described as stochastic processes, using po

Node-Deletion NP-Complete Problems
Node-Deletion NP-Complete Problems
โœ Krishnamoorthy, M. S.; Deo, Narsingh ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 854 KB