A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets.
Diego Alejandro Morán RamírezSantanu S. DeyPublished in: IPCO (2013)
Keyphrases
- mixed integer
- worst case
- computational complexity
- optimal solution
- np hard
- learning algorithm
- convex hull
- k means
- dynamic programming
- computationally efficient
- particle swarm optimization
- global optimization problems
- probabilistic model
- search space
- linear programming
- special case
- objective function
- linear programming problems
- reinforcement learning