A Competitive-cooperative Approach to Complex Combinatorial Search

@inproceedings{Moscato1991ACA,
  title={A Competitive-cooperative Approach to Complex Combinatorial Search},
  author={Pablo Moscato},
  year={1991}
}
Combinatorial optimization problems confront us with the problem of searching in a huge connguration space. Associated with each of these conngura-tions is the value of a utility function and the optimization task generally consists of nding the connguration which has either the lowest or the highest cost of all. Among the most diicult of these problems are those which belong to the NP-complete class for which, it is conjectured, there does not exist a polynomial-time algorithm that can give… CONTINUE READING