@@ -1152,7 +1152,7 @@ void HighsPrimalHeuristics::shifting(const std::vector<double>& relaxationsol) {
11521152 if (currentLp.col_lower_ [j] == currentLp.col_upper_ [j]) continue ;
11531153
11541154 // lambda for finding best shift
1155- auto repair = [this , &findPairByIndex, ¤t_fractional_integers,
1155+ auto repair = [&findPairByIndex, ¤t_fractional_integers,
11561156 &findShiftsByIndex, &shift_iterations_set, &t,
11571157 &score_min, &j_min, &aij_min, &x_j_min,
11581158 ¤t_relax_solution, &moveValueUp](
@@ -1274,8 +1274,8 @@ void HighsPrimalHeuristics::shifting(const std::vector<double>& relaxationsol) {
12741274 assert (col >= 0 );
12751275 assert (col < mipsolver.numCol ());
12761276
1277- auto isBetter = [this , ¤tLp, &it, &xi_max, &delta_c_min,
1278- &pind_j_min, & j_min, &x_j_min, &sigma,
1277+ auto isBetter = [¤tLp, &it, &xi_max, &delta_c_min, &pind_j_min ,
1278+ &j_min, &x_j_min, &sigma,
12791279 &i](double col, double xi, double roundedval,
12801280 HighsInt direction) {
12811281 double c_min = currentLp.col_cost_ [col] * (roundedval - it.second );
0 commit comments