On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
Sounaka MishraKripasindhu SikdarPublished in: IFIP TCS (2000)
Keyphrases
- optimization problems
- computational complexity
- evolutionary algorithm
- np complete
- np hard
- cost function
- information systems
- closely related
- knowledge base
- multi objective
- objective function
- metaheuristic
- neural network
- information theoretic
- traveling salesman problem
- partial order
- benchmark problems
- optimization methods
- np hardness