Skip to content

Remove left over kernels #430

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

Merged
rapids-bot merged 3 commits into from
Oct 3, 2025
Merged

Remove left over kernels #430

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
4c6704f
remove left-over kernels and fix logs
akifcorduk Oct 2, 2025
919c3d3
fix more logs
akifcorduk Oct 2, 2025
3b4796a
Merge branch 'branch-25.10' into remove_residual
rgsl888prabhu Oct 2, 2025
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
12 changes: 6 additions & 6 deletions cpp/src/mip/diversity/population.cu
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -168,10 +168,10 @@ void population_t<i_t, f_t>::add_external_solution(const std::vector<f_t>& solut
external_solution_queue_cpufj.erase(external_solution_queue_cpufj.begin() + worst_obj_idx);
}

CUOPT_LOG_INFO("%s added a solution to population, solution queue size %lu with objective %g",
solution_origin_to_string(origin),
external_solution_queue.size(),
problem_ptr->get_user_obj_from_solver_obj(objective));
CUOPT_LOG_DEBUG("%s added a solution to population, solution queue size %lu with objective %g",
solution_origin_to_string(origin),
external_solution_queue.size(),
problem_ptr->get_user_obj_from_solver_obj(objective));
if (external_solution_queue.size() >= 5) { early_exit_primal_generation = true; }
}

Expand Down Expand Up @@ -227,8 +227,8 @@ std::vector<solution_t<i_t, f_t>> population_t<i_t, f_t>::get_external_solutions
}
}
if (external_solution_queue.size() > 0) {
CUOPT_LOG_INFO("Consuming B&B solutions, solution queue size %lu",
external_solution_queue.size());
CUOPT_LOG_DEBUG("Consuming B&B solutions, solution queue size %lu",
external_solution_queue.size());
external_solution_queue.clear();
}
external_solution_queue_cpufj.clear();
Expand Down
2 changes: 1 addition & 1 deletion cpp/src/mip/local_search/rounding/constraint_prop.cu
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -907,7 +907,7 @@ bool constraint_prop_t<i_t, f_t>::find_integer(

CUOPT_LOG_DEBUG("Bounds propagation rounding: unset vars %lu", unset_integer_vars.size());
if (unset_integer_vars.size() == 0) {
CUOPT_LOG_ERROR("No integer variables provided in the bounds prop rounding");
CUOPT_LOG_DEBUG("No integer variables provided in the bounds prop rounding");
expand_device_copy(orig_sol.assignment, sol.assignment, sol.handle_ptr->get_stream());
cuopt_func_call(orig_sol.test_variable_bounds());
return orig_sol.compute_feasibility();
Expand Down
229 changes: 0 additions & 229 deletions cpp/src/mip/presolve/spmv_kernels.cuh
View file
Open in desktop

This file was deleted.

20 changes: 10 additions & 10 deletions cpp/src/mip/presolve/third_party_presolve.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -274,30 +274,30 @@ void check_presolve_status(const papilo::PresolveStatus& status)
{
switch (status) {
case papilo::PresolveStatus::kUnchanged:
CUOPT_LOG_INFO("Presolve status:: did not result in any changes");
CUOPT_LOG_INFO("Presolve status: did not result in any changes");
break;
case papilo::PresolveStatus::kReduced:
CUOPT_LOG_INFO("Presolve status:: reduced the problem");
CUOPT_LOG_INFO("Presolve status: reduced the problem");
break;
case papilo::PresolveStatus::kUnbndOrInfeas:
CUOPT_LOG_INFO("Presolve status:: found an unbounded or infeasible problem");
CUOPT_LOG_INFO("Presolve status: found an unbounded or infeasible problem");
break;
case papilo::PresolveStatus::kInfeasible:
CUOPT_LOG_INFO("Presolve status:: found an infeasible problem");
CUOPT_LOG_INFO("Presolve status: found an infeasible problem");
break;
case papilo::PresolveStatus::kUnbounded:
CUOPT_LOG_INFO("Presolve status:: found an unbounded problem");
CUOPT_LOG_INFO("Presolve status: found an unbounded problem");
break;
}
}

void check_postsolve_status(const papilo::PostsolveStatus& status)
{
switch (status) {
case papilo::PostsolveStatus::kOk: CUOPT_LOG_INFO("Post-solve status:: succeeded"); break;
case papilo::PostsolveStatus::kOk: CUOPT_LOG_INFO("Post-solve status: succeeded"); break;
case papilo::PostsolveStatus::kFailed:
CUOPT_LOG_INFO(
"Post-solve status:: Post solved solution violates constraints. This is most likely due to "
"Post-solve status: Post solved solution violates constraints. This is most likely due to "
"different tolerances.");
break;
}
Expand Down Expand Up @@ -362,7 +362,7 @@ std::pair<optimization_problem_t<i_t, f_t>, bool> third_party_presolve_t<i_t, f_
{
papilo::Problem<f_t> papilo_problem = build_papilo_problem(op_problem);

CUOPT_LOG_INFO("Unpresolved problem:: %d constraints, %d variables, %d nonzeros",
CUOPT_LOG_INFO("Unpresolved problem: %d constraints, %d variables, %d nonzeros",
papilo_problem.getNRows(),
papilo_problem.getNCols(),
papilo_problem.getConstraintMatrix().getNnz());
Expand All @@ -382,11 +382,11 @@ std::pair<optimization_problem_t<i_t, f_t>, bool> third_party_presolve_t<i_t, f_
return std::make_pair(optimization_problem_t<i_t, f_t>(op_problem.get_handle_ptr()), false);
}
post_solve_storage_ = result.postsolve;
CUOPT_LOG_INFO("Presolve removed:: %d constraints, %d variables, %d nonzeros",
CUOPT_LOG_INFO("Presolve removed: %d constraints, %d variables, %d nonzeros",
op_problem.get_n_constraints() - papilo_problem.getNRows(),
op_problem.get_n_variables() - papilo_problem.getNCols(),
op_problem.get_nnz() - papilo_problem.getConstraintMatrix().getNnz());
CUOPT_LOG_INFO("Presolved problem:: %d constraints, %d variables, %d nonzeros",
CUOPT_LOG_INFO("Presolved problem: %d constraints, %d variables, %d nonzeros",
papilo_problem.getNRows(),
papilo_problem.getNCols(),
papilo_problem.getConstraintMatrix().getNnz());
Expand Down