diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Kml_reader.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Kml_reader.cpp
index 9e8df3dd72e..cd4d3bc20f6 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Kml_reader.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Kml_reader.cpp
@@ -269,7 +269,7 @@ Kml::Nodes Kml::generate_ids_approx(Placemarks& placemarks, const double eps) {
 
         for (const auto& node : lring->nodes) {
           // check if there is a node sufficiently close to the current one
-          auto node_index = std::numeric_limits<std::size_t>::max();
+          auto node_index = (std::numeric_limits<std::size_t>::max)();
           for (std::size_t i = 0; i < nodes.size(); ++i) {
             const auto dist = node.distance_to(nodes[i]);
             if (dist < eps) {
@@ -278,7 +278,7 @@ Kml::Nodes Kml::generate_ids_approx(Placemarks& placemarks, const double eps) {
             }
           }
 
-          if (node_index == std::numeric_limits<std::size_t>::max()) {
+          if (node_index == (std::numeric_limits<std::size_t>::max)()) {
             // insert new node
             nodes.push_back(node);
             const auto node_id = nodes.size() - 1;
@@ -301,7 +301,7 @@ Kml::Nodes Kml::generate_ids_approx(Placemarks& placemarks, const double eps) {
   }
 
   // find the pair of closest nodes
-  double min_dist = std::numeric_limits<double>::max();
+  double min_dist = (std::numeric_limits<double>::max)();
   std::size_t ni1 = 0;
   std::size_t ni2 = 0;
   std::size_t num_nodes = nodes.size();
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_Delaunay_triangulation_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_Delaunay_triangulation_3.h
index 39aa8061544..c6c06f1e904 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_Delaunay_triangulation_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_Delaunay_triangulation_3.h
@@ -510,7 +510,7 @@ public:
 
   auto min_distance_and_vertex_between_constraint_and_encroaching_vertex(Vertex_handle va, Vertex_handle vb) const {
     struct Result {
-      typename T_3::Geom_traits::FT min_dist = std::numeric_limits<double>::max();
+      typename T_3::Geom_traits::FT min_dist = (std::numeric_limits<double>::max)();
       Vertex_handle v = {};
     } result;
     const auto vector_of_encroaching_vertices = encroaching_vertices(va, vb);
diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
index dc2aed29b5f..f71c3789fee 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
@@ -551,7 +551,7 @@ public:
   /** \name Constructors
   @{
 
-  \c Conforming_constrained_Delaunay_triangulation_3 can be constructed from either 
+  \c Conforming_constrained_Delaunay_triangulation_3 can be constructed from either
   a polygon soup or a polygon mesh.
 
   ## Input Data
diff --git a/Lab/demo/Lab/Scene_triangulation_3_item.cpp b/Lab/demo/Lab/Scene_triangulation_3_item.cpp
index a0375aa2316..6480df09d98 100644
--- a/Lab/demo/Lab/Scene_triangulation_3_item.cpp
+++ b/Lab/demo/Lab/Scene_triangulation_3_item.cpp
@@ -987,7 +987,7 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& base_color)
 Geom_traits::Plane_3 Scene_triangulation_3_item::plane(CGAL::qglviewer::Vec offset) const
 {
   if (!d->is_intersection_enabled())
-    return Geom_traits::Plane_3(1.0, 0.0, 0.0, std::numeric_limits<float>::max());
+    return Geom_traits::Plane_3(1.0, 0.0, 0.0, (std::numeric_limits<float>::max)());
   const CGAL::qglviewer::Vec& pos = d->frame->position() - offset;
   const CGAL::qglviewer::Vec& n =
     d->frame->inverseTransformOf(CGAL::qglviewer::Vec(0.f, 0.f, 1.f));
diff --git a/Surface_mesh_topology/benchmark/Surface_mesh_topology/path_homotopy_with_schema.cpp b/Surface_mesh_topology/benchmark/Surface_mesh_topology/path_homotopy_with_schema.cpp
index e6d3b3d7104..8ff4afc1360 100644
--- a/Surface_mesh_topology/benchmark/Surface_mesh_topology/path_homotopy_with_schema.cpp
+++ b/Surface_mesh_topology/benchmark/Surface_mesh_topology/path_homotopy_with_schema.cpp
@@ -112,7 +112,7 @@ int main(int argc, char** argv)
   {
     if (i!=0)
     {
-      random=CGAL::Random(random.get_int(0, std::numeric_limits<int>::max()));
+      random=CGAL::Random(random.get_int(0, (std::numeric_limits<int>::max)()));
     }
     std::cout<<"Random seed: "<<random.get_seed()<<": ";
 
diff --git a/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp b/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp
index 1b75496d684..32f7cd1ac16 100644
--- a/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp
+++ b/Triangulation_3/test/Triangulation_3/cdt_3_from_off.cpp
@@ -550,7 +550,7 @@ int go(Mesh mesh, CDT_options options) {
   start_time = std::chrono::high_resolution_clock::now();
   CGAL_CDT_3_TASK_BEGIN(compute_distances_task_handle);
   {
-    auto [min_sq_distance, min_edge] = std::ranges::min(
+    auto [min_sq_distance, min_edge] = (std::ranges::min)(
         cdt.finite_edges() | std::views::transform([&](auto edge) { return std::make_pair(cdt.segment(edge).squared_length(), edge); }));
     auto min_distance = CGAL::approximate_sqrt(min_sq_distance);
     auto vertices_of_min_edge = cdt.vertices(min_edge);
@@ -566,7 +566,7 @@ int go(Mesh mesh, CDT_options options) {
     }
   }
   {
-    double min_distance = std::numeric_limits<double>::max();
+    double min_distance = (std::numeric_limits<double>::max)();
     CDT::Vertex_handle min_va, min_vb, min_vertex;
     if(options.merge_facets) {
       for(int i = 0; i < nb_patches; ++i) {