On Solving Cycle Problems with Branch-and-Cut: Extending Shrinking and Exact Subcycle Elimination Separation Algorithms.
Gorka KobeagaMaría MerinoJosé Antonio LozanoPublished in: CoRR (2020)
Keyphrases
- optimization problems
- combinatorial optimization
- quadratic optimization problems
- orders of magnitude
- constrained problems
- exact solution
- convex optimization problems
- constraint problems
- problems in artificial intelligence
- benchmark problems
- test problems
- solving problems
- computational cost
- related problems
- resource constrained project scheduling problem
- discrete optimization
- computational problems
- exact algorithms
- global optimization problems
- partial solutions
- exact and approximate
- computational complexity
- np complete
- theoretical guarantees
- significant improvement
- worst case
- run times
- quadratic programming
- data mining techniques
- np complete problems
- approximate solutions
- brute force
- quadratic program
- computationally efficient
- graph coloring
- search problems
- search heuristics
- difficult problems
- nonlinear programming
- search algorithm