diff --git a/examples/dotnet/NetworkRoutingSat.cs b/examples/dotnet/NetworkRoutingSat.cs
index 4c400ebca1..0e6af03be0 100644
--- a/examples/dotnet/NetworkRoutingSat.cs
+++ b/examples/dotnet/NetworkRoutingSat.cs
@@ -24,7 +24,7 @@ using System.Linq;
 /// (source, destination, traffic), the goal is to assign one unique
 /// path for each demand such that the cost is minimized.  The cost is
 /// defined by the maximum ratio utilization (traffic/capacity) for all
-/// arcs.  There is also a penalty associated with an traffic of an arc
+/// arcs.  There is also a penalty associated with a traffic of an arc
 /// being above the comfort zone, 85% of the capacity by default.
 /// Please note that constraint programming is well suited here because
 /// we cannot have multiple active paths for a single demand.
diff --git a/examples/dotnet/csintegerprogramming.cs b/examples/dotnet/csintegerprogramming.cs
index a17b8e099d..d3e1041e99 100644
--- a/examples/dotnet/csintegerprogramming.cs
+++ b/examples/dotnet/csintegerprogramming.cs
@@ -103,6 +103,7 @@ public class CsIntegerProgramming
     {
         CppBridge.InitLogging("csintegerprogramming.cs");
         CppFlags flags = new CppFlags();
+        flags.stderrthreshold = 0;
         flags.log_prefix = false;
         CppBridge.SetFlags(flags);