A Combinatorial Algorithm for Solving Covering Problems.
Ioan TomescuPublished in: IEEE Trans. Computers (1973)
Keyphrases
- dynamic programming
- convex quadratic programming
- quadratic optimization problems
- combinatorial optimization
- computational geometry
- search algorithm for solving
- benchmark problems
- k means
- cost function
- test problems
- significant improvement
- optimization algorithm
- segmentation algorithm
- algebraic equations
- optimal solution
- preprocessing
- computational complexity
- efficient algorithms for solving
- quadratic programming
- solving problems
- gradient projection
- particle swarm optimization
- matching algorithm
- ant colony optimization
- neural network
- linear programming
- simulated annealing
- worst case
- computational cost
- np hard
- search space
- lower bound
- similarity measure
- learning algorithm