--- Couenne-0.5.7/src/branch/StrongBranchingSetupList.cpp.orig	2012-06-11 21:41:05.000000000 -0600
+++ Couenne-0.5.7/src/branch/StrongBranchingSetupList.cpp	2019-06-22 18:44:58.089475200 -0600
@@ -262,7 +262,7 @@ inline bool compStrongPri (struct objStr
 
 	CoinFillN (varObj, n, -1);
 
-	for (unsigned int i = 0; i < numberObjects; i++) {
+	for (int i = 0; i < numberObjects; i++) {
 
 	  int indVar = objectOrig [i] -> columnNumber ();
 
@@ -415,9 +415,9 @@ inline bool compStrongPri (struct objStr
 
     while (numberOnList_ == 0) { // FIXME: add iteration limit
 
-      for (unsigned int i = 0; i < numberObjects; i++) {
+      for (int i = 0; i < numberObjects; i++) {
 
-	int indexObj = ((objectInd.size () > 0) && (i < objectInd.size ())) ? objectInd [i] : i;
+	int indexObj = ((objectInd.size () > 0) && ((size_t)i < objectInd.size ())) ? objectInd [i] : i;
 
 	int way;
 	//double value = object [indexObj] -> checkInfeasibility (info);
--- Couenne-0.5.7/src/convex/generateCuts.cpp.orig	2014-03-12 19:35:13.000000000 -0600
+++ Couenne-0.5.7/src/convex/generateCuts.cpp	2019-06-22 18:43:07.720675304 -0600
@@ -477,13 +477,13 @@ void CouenneCutGenerator::generateCuts (
 
 	if (jnlst_ -> ProduceOutput (J_VECTOR, J_BOUNDTIGHTENING)) {
 	  printf ("orbit bounds: "); fflush (stdout);
-	  for(int j = 0; j < orbit.size (); j++) {
+	  for(size_t j = 0; j < orbit.size (); j++) {
 	    printf ("x_%d [%g,%g] ", orbit[j], lb [orbit [j]], ub [orbit [j]]);
 	    fflush (stdout);
 	  }
 	}
 
-	for (int j = 0; j < orbit.size (); j++) {
+	for (size_t j = 0; j < orbit.size (); j++) {
  
 	  int indOrb = orbit [j];
 
@@ -497,7 +497,7 @@ void CouenneCutGenerator::generateCuts (
 	jnlst_ -> Printf (J_VECTOR, J_BOUNDTIGHTENING, 
 			  " --> new common bounds: [%g,%g]\n", ll, uu);
 
-	for(int j = 0; j < orbit.size (); j++) {
+	for(size_t j = 0; j < orbit.size (); j++) {
 
 	  int indOrb = orbit [j];