521 citations · 534 across the 3 of their papers we have counts for
1 paper · 1 filter
Tom Marty, Tristan François, Pierre Tessier +3
Constraint programming is known for being an efficient approach for solving combinatorial problems. Important design choices in a solver are the branching heuristics, which are des…