Pooling Problems with Polynomial-Time Algorithms.
Dag HauglandEligius M. T. HendrixPublished in: J. Optim. Theory Appl. (2016)
Keyphrases
- optimization problems
- benchmark problems
- computational cost
- computational complexity
- related problems
- problems in computer vision
- computational geometry
- practical problems
- test problems
- difficult problems
- approximate solutions
- orders of magnitude
- convex optimization problems
- worst case
- significant improvement
- evolutionary algorithm
- computational problems
- polynomial time complexity
- specific problems
- greedy algorithms
- computationally hard
- np hard problems
- run times
- minimum cost flow
- suboptimal solutions
- learning algorithm
- theoretical guarantees
- exact algorithms
- search problems
- search methods
- combinatorial optimization
- benchmark datasets
- computationally efficient
- np complete
- upper bound
- special case