On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms.
Gorka KobeagaMaría MerinoJosé Antonio LozanoPublished in: Ann. Oper. Res. (2021)
Keyphrases
- optimization problems
- combinatorial optimization
- convex optimization problems
- learning algorithm
- search methods
- benchmark problems
- exact solution
- exact and approximate
- data structure
- problems in artificial intelligence
- global optimization problems
- constrained problems
- constraint problems
- resource constrained project scheduling problem
- discrete optimization
- search heuristics
- exact algorithms
- approximate solutions
- difficult problems
- quadratic programming
- practical problems
- test problems
- computationally efficient
- quadratic optimization problems
- continuous domains
- np complete problems
- run times
- bilevel programming
- computational cost
- solving complex
- related problems
- sparse linear systems