67 citations · 73 across the 7 of their papers we have counts for
Showing 2022 · math.OCShow all
2 papers · 2 filters
math.OC2022★ 1 cited
Faster exact solution of sparse MaxCut and QUBO problems
Daniel Rehfeldt, Thorsten Koch, Yuji Shinano
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic un…
math.OC2022★ 1 cited
Adaptive Cut Selection in Mixed-Integer Linear Programming
Mark Turner, Thorsten Koch, Felipe Serrano +1
Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver…