Experimental algorithms for the dualization problem
By: Mauro Mezzini , Fernando Cuartero Gomez , Jose Javier Paulet Gonzalez and more
Potential Business Impact:
Finds the fastest way to solve hard math problems.
In this paper, we present experimental algorithms for solving the dualization problem. We present the results of extensive experimentation comparing the execution time of various algorithms.
Similar Papers
Connections between convex optimization algorithms and subspace correction methods
Optimization and Control
Unlocks new math tricks for faster computer problem-solving.
An Optimal Control Interpretation of Augmented Distributed Optimization Algorithms
Optimization and Control
Makes smart networks work better, faster.
Primal-dual algorithm for contextual stochastic combinatorial optimization
Machine Learning (CS)
Helps computers make smart choices with uncertain info.