mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-05-03 22:05:45 +00:00
Code Activity

add branch / cut selection heuristic from solver=2

Browse source 
disabled for testing.
This commit is contained in:
Nikolaj Bjorner 2023-04-10 22:14:03 -07:00
parent bb44b91e45
commit 368d60f553
6 changed files with 114 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

15
src/math/lp/gomory.cpp
View file

@ -377,10 +377,20 @@ bool gomory::is_gomory_cut_target(const row_strip<mpq>& row) {
}
int gomory::find_basic_var() {
int result = -1;
unsigned n = 0;
int result = -1;
unsigned min_row_size = UINT_MAX;
// Prefer smaller row size
#if 0
result = lia.select_int_infeasible_var();
if (result == -1)
return result;
const row_strip<mpq>& row = lra.get_row(lia.row_of_basic_column(result));
if (is_gomory_cut_target(row))
return result;
#endif
for (unsigned j : lra.r_basis()) {
if (!lia.column_is_int_inf(j))
@ -389,6 +399,7 @@ int gomory::find_basic_var() {
if (!is_gomory_cut_target(row))
continue;
IF_VERBOSE(20, lia.display_row_info(verbose_stream(), lia.row_of_basic_column(j)));
// Prefer smaller row size
if (min_row_size == UINT_MAX ||
2*row.size() < min_row_size ||
(4*row.size() < 5*min_row_size && lia.random() % (++n) == 0)) {