Boolean Approaches to Combinatorial Optimization
Key Words:   
Fund Project:
Author NameAffiliation
P. L. Hammer RUTCOR
The State University of New Jersey
U. S. A. 
Liu Yanpei Institute of Applied Mathematics
Academia Sinica
B. Simeone Dipartimento di Statistica
Probabilita e Statistiche Applicate
Universita di Roma "La Sapienza"
Hits: 1930
Download times: 976
      The parpose of this paper is to show the main progresses in combinatorial optimization from the point of view of the theory of NP- Completeness in com-puting complexity although only Boalean methods are discussed. Meanwhile, we also propose a number of unsolved problems with some possible approaches for further research.
View Full Text  View/Add Comment  Download reader