diff --git a/src/mip/HighsFeasibilityJump.cpp b/src/mip/HighsFeasibilityJump.cpp
index 6734e25f7c..a037f30ff4 100644
--- a/src/mip/HighsFeasibilityJump.cpp
+++ b/src/mip/HighsFeasibilityJump.cpp
@@ -69,7 +69,8 @@ void HighsMipSolverData::feasibilityJump() {
     col_value[i] = initial_assignment;
   }
 
-  // TODO(BenChampion): make a row-wise copy of model->a_matrix_ and remove these buffers
+  // TODO(BenChampion): make a row-wise copy of model->a_matrix_ and remove
+  // these buffers
   HighsInt row_num_nz;
   HighsInt* row_index_buffer = new HighsInt[model->num_col_];
   double* row_value_buffer = new double[model->num_col_];
diff --git a/src/mip/feasibilityjump.hh b/src/mip/feasibilityjump.hh
index 9a6b74232c..3e092f492a 100644
--- a/src/mip/feasibilityjump.hh
+++ b/src/mip/feasibilityjump.hh
@@ -367,7 +367,7 @@ class JumpMove {
           bestShiftBuffer.emplace_back(validRange.second, constraint.weight);
       }
     }
-    //TODO(BenChampion): is there a better way to handle non-finite bounds?
+    // TODO(BenChampion): is there a better way to handle non-finite bounds?
     if (std::isfinite(problem.vars[varIdx].lb)) {
       bestShiftBuffer.emplace_back(problem.vars[varIdx].lb, 0);
     }
@@ -565,7 +565,8 @@ class FeasibilityJumpSolver {
           bestVarIdx = cell.idx;
         }
       }
-      // TODO(BenChampion): is there a better way to handle or prevent this case?
+      // TODO(BenChampion): is there a better way to handle or prevent this
+      // case?
       if (bestVarIdx != UINT_MAX) {
         return bestVarIdx;
       }