An efficient algorithm for solving elliptic problems on percolation clusters.
Chenlin GuPublished in: CoRR (2019)
Keyphrases
- dynamic programming
- detection algorithm
- combinatorial optimization
- benchmark problems
- preprocessing
- k means
- learning algorithm
- constrained problems
- np hard
- arbitrary shaped
- computational complexity
- convex quadratic programming
- algebraic equations
- global optimization problems
- iterative algorithms
- data clustering
- stochastic shortest path
- optimization algorithm
- computationally efficient
- expectation maximization
- simulated annealing
- search space
- high dimensional
- similarity measure
- genetic algorithm
- segmentation algorithm
- solving problems
- partial solutions
- linear programming
- graph coloring
- cost function
- search algorithm for solving
- optimal solution
- quadratic optimization problems