A condition-based algorithm for solving polyhedral feasibility problems.
Negar SoheiliJavier PeñaPublished in: J. Complex. (2014)
Keyphrases
- cost function
- benchmark problems
- optimization algorithm
- learning algorithm
- objective function
- convex quadratic programming
- computational complexity
- graph coloring
- linear programming
- combinatorial optimization
- detection algorithm
- combinatorial optimisation
- constrained problems
- iterative algorithms
- convex hull
- matching algorithm
- simulated annealing
- preprocessing
- neural network
- probabilistic model
- test problems
- quadratic programming
- computational cost
- search heuristics
- dynamic programming
- significant improvement
- algebraic equations
- optimal solution
- quadratic optimization problems