4 citations · 5 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.AI2013★ 1 cited
DASH: Dynamic Approach for Switching Heuristics
Giovanni Di Liberto, Serdar Kadioglu, Kevin Leo +1
Complete tree search is a highly effective method for tackling MIP problems, and over the years, a plethora of branching heuristics have been introduced to further refine the techn…
cs.AI2013
Proteus: A Hierarchical Portfolio of Solvers and Transformations
Barry Hurley, Lars Kotthoff, Yuri Malitsky +1
In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT…