Lattice theoretic ordering properties for NP-complete optimization problems.
Giorgio AusielloAlessandro D'AtriMarco ProtasiPublished in: Fundam. Informaticae (1981)
Keyphrases
- np complete
- optimization problems
- randomly generated
- evolutionary algorithm
- metaheuristic
- constraint satisfaction problems
- neural network
- computational complexity
- desirable properties
- optimization methods
- satisfiability problem
- real time
- structural properties
- cost function
- data complexity
- particle swarm optimization
- topological properties
- pspace complete
- upper bound
- scheduling problem
- case study
- artificial intelligence
- databases
- data sets