disable initial cliques

Author: akifcorduk

cpp/src/mip_heuristics/diversity/diversity_manager.cu

@@ -209,32 +209,32 @@ bool diversity_manager_t<i_t, f_t>::run_presolve(f_t time_limit, timer_t global_
   const bool remap_cache_ids = true;
   if (!global_timer.check_time_limit()) { trivial_presolve(*problem_ptr, remap_cache_ids); }
   if (!problem_ptr->empty && !check_bounds_sanity(*problem_ptr)) { return false; }
-  if (!presolve_timer.check_time_limit() && !context.settings.heuristics_only &&
-      !problem_ptr->empty) {
-    f_t time_limit_for_clique_table = std::min(3., presolve_timer.remaining_time() / 5);
-    timer_t clique_timer(time_limit_for_clique_table);
-    dual_simplex::user_problem_t<i_t, f_t> host_problem(problem_ptr->handle_ptr);
-    problem_ptr->get_host_user_problem(host_problem);
-    std::shared_ptr<clique_table_t<i_t, f_t>> clique_table;
-    constexpr bool modify_problem_with_cliques = false;
-    find_initial_cliques(host_problem,
-                         context.settings.tolerances,
-                         &clique_table,
-                         clique_timer,
-                         modify_problem_with_cliques,
-                         nullptr);
-    if (modify_problem_with_cliques) {
-      problem_ptr->set_constraints_from_host_user_problem(host_problem);
-      cuopt_assert(host_problem.lower.size() == static_cast<size_t>(problem_ptr->n_variables),
-                   "host lower bound size mismatch");
-      cuopt_assert(host_problem.upper.size() == static_cast<size_t>(problem_ptr->n_variables),
-                   "host upper bound size mismatch");
-      std::vector<i_t> all_var_indices(problem_ptr->n_variables);
-      std::iota(all_var_indices.begin(), all_var_indices.end(), 0);
-      problem_ptr->update_variable_bounds(all_var_indices, host_problem.lower, host_problem.upper);
-      trivial_presolve(*problem_ptr, remap_cache_ids);
-    }
-  }
+  // if (!presolve_timer.check_time_limit() && !context.settings.heuristics_only &&
+  //     !problem_ptr->empty) {
+  //   f_t time_limit_for_clique_table = std::min(3., presolve_timer.remaining_time() / 5);
+  //   timer_t clique_timer(time_limit_for_clique_table);
+  //   dual_simplex::user_problem_t<i_t, f_t> host_problem(problem_ptr->handle_ptr);
+  //   problem_ptr->get_host_user_problem(host_problem);
+  //   std::shared_ptr<clique_table_t<i_t, f_t>> clique_table;
+  //   constexpr bool modify_problem_with_cliques = false;
+  //   find_initial_cliques(host_problem,
+  //                        context.settings.tolerances,
+  //                        &clique_table,
+  //                        clique_timer,
+  //                        modify_problem_with_cliques,
+  //                        nullptr);
+  //   if (modify_problem_with_cliques) {
+  //     problem_ptr->set_constraints_from_host_user_problem(host_problem);
+  //     cuopt_assert(host_problem.lower.size() == static_cast<size_t>(problem_ptr->n_variables),
+  //                  "host lower bound size mismatch");
+  //     cuopt_assert(host_problem.upper.size() == static_cast<size_t>(problem_ptr->n_variables),
+  //                  "host upper bound size mismatch");
+  //     std::vector<i_t> all_var_indices(problem_ptr->n_variables);
+  //     std::iota(all_var_indices.begin(), all_var_indices.end(), 0);
+  //     problem_ptr->update_variable_bounds(all_var_indices, host_problem.lower,
+  //     host_problem.upper); trivial_presolve(*problem_ptr, remap_cache_ids);
+  //   }
+  // }
   // May overconstrain if Papilo presolve has been run before
   if (context.settings.presolver == presolver_t::None) {
     if (!problem_ptr->empty) {