On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem.
Sounaka MishraKripasindhu SikdarPublished in: RAIRO Theor. Informatics Appl. (2001)
Keyphrases
- feature selection
- optimization problems
- computational complexity
- evolutionary algorithm
- np complete
- np hard
- machine learning
- real time
- partial order
- metaheuristic
- cost function
- neural network
- genetic algorithm
- combinatorial optimization
- optimization methods
- multi objective
- lower bound
- objective function
- case study
- website
- information systems
- computer vision