A class of problems of NP to be worth to search an efficient solving algorithm
Anatoly D. PlotnikovPublished in: CoRR (1999)
Keyphrases
- convex quadratic programming
- search space
- search mechanism
- search strategy
- computational complexity
- combinatorial optimization
- dynamic programming
- partial solutions
- search algorithm
- benchmark problems
- np hard
- combinatorial optimisation
- algebraic equations
- combinatorial search
- optimal solution
- learning algorithm
- multi class classification
- objective function
- cost function
- search algorithm for solving
- systematic search
- iterative algorithms
- detection algorithm
- segmentation algorithm
- computationally efficient
- particle swarm optimization
- probabilistic model
- evolutionary algorithm
- exhaustive search
- search efficiency
- search methods
- path finding
- linear programming problems
- expectation maximization
- optimization problems