Algorithms to Separate {0, \frac12}\{0, \frac{1}{2}\} -Chvátal-Gomory Cuts.
Arie M. C. A. KosterAdrian ZymolkaManuel KutschkaPublished in: Algorithmica (2009)
Keyphrases
- learning algorithm
- lower bound
- data structure
- computational cost
- recently developed
- computationally expensive
- orders of magnitude
- theoretical analysis
- machine learning algorithms
- strictly convex
- neural network
- computational efficiency
- optimization problems
- computationally efficient
- upper bound
- dynamic programming
- computational complexity