Skip to content

Complement variables, rationalize coefficients and scale in order to find knapsack cuts. Lift knapsack cuts #970

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
chris-maes wants to merge 4 commits into
base: main
Choose a base branch
from
Open

Complement variables, rationalize coefficients and scale in order to find knapsack cuts. Lift knapsack cuts #970

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
3051531
Complement variables in order to find knapsack cuts
chris-maes Mar 17, 2026
daad714
Merge remote-tracking branch 'cuopt-nvidia/main' into knapsack_improve
chris-maes Mar 17, 2026
c2a7331
Convert coefficients to integers in rows when looking for knapsack co…
chris-maes Mar 18, 2026
b07feed
Lift knapsack cuts
chris-maes Mar 18, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 1 addition & 7 deletions cpp/src/branch_and_bound/branch_and_bound.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -724,12 +724,6 @@ void branch_and_bound_t<i_t, f_t>::set_final_solution(mip_solution_t<i_t, f_t>&
obj,
is_maximization ? "Upper" : "Lower",
user_bound);
{
const f_t root_lp_obj = root_lp_current_lower_bound_.load();
if (std::isfinite(root_lp_obj)) {
settings_.log.printf("Root LP dual objective (last): %.16e\n", root_lp_obj);
}
}

if (gap <= settings_.absolute_mip_gap_tol || gap_rel <= settings_.relative_mip_gap_tol) {
solver_status_ = mip_status_t::OPTIMAL;
Expand Down Expand Up @@ -2220,7 +2214,7 @@ mip_status_t branch_and_bound_t<i_t, f_t>::solve(mip_solution_t<i_t, f_t>& solut
i_t num_cuts = cut_pool.get_best_cuts(cuts_to_add, cut_rhs, cut_types);
if (num_cuts == 0) { break; }
cut_info.record_cut_types(cut_types);
#ifdef PRINT_CUT_POOL_TYPES
#if 1
cut_pool.print_cutpool_types();
print_cut_types("In LP ", cut_types, settings_);
printf("Cut pool size: %d\n", cut_pool.pool_size());
Expand Down
Loading