chore: update notebook callouts

opvious · Nov 26, 2024 · fbd6b45 · fbd6b45
1 parent 44e0d7a
commit fbd6b45
Show file tree

Hide file tree

Showing 4 changed files with 5 additions and 272 deletions.
diff --git a/resources/examples/bin-packing.ipynb b/resources/examples/bin-packing.ipynb
@@ -202,7 +202,7 @@
       "name": "python",
       "nbconvert_exporter": "python",
       "pygments_lexer": "ipython3",
-      "version": "3.12.5"
+      "version": "3.12.7"
     }
   },
   "nbformat": 4,

diff --git a/resources/examples/consecutive-shift-scheduling.ipynb b/resources/examples/consecutive-shift-scheduling.ipynb
@@ -8,7 +8,7 @@
         "# Consecutive shift scheduling\n",
         "\n",
         "<div class=\"alert alert-block alert-info\">\n",
-        "    &#9432; The code in this notebook requires a valid Opvious account. You may execute it from your browser <a href=\"https://www.opvious.io/notebooks/retro/notebooks/?path=examples/sudoku.ipynb\">here</a> if you update the client's creation below to use an explicit API token corresponding to your account.\n",
+        "    &#9432; The code in this notebook requires a valid Opvious license. You may execute it from your browser <a href=\"https://www.opvious.io/notebooks/retro/notebooks/?path=examples/sudoku.ipynb\">at this URL</a> if you update the client's creation below to point to your licensed API.\n",
         "</div>"
       ]
     },
@@ -210,7 +210,7 @@
       "name": "python",
       "nbconvert_exporter": "python",
       "pygments_lexer": "ipython3",
-      "version": "3.12.5"
+      "version": "3.12.7"
     }
   },
   "nbformat": 4,

diff --git a/resources/guides/uploading-a-model.ipynb b/resources/guides/uploading-a-model.ipynb
diff --git a/resources/guides/welcome.ipynb b/resources/guides/welcome.ipynb
@@ -10,7 +10,7 @@
         "In this notebook we introduce [Opvious](https://www.opvious.io), a _batteries-included optimization platform_, by walking through an end-to-end optimization example.\n",
         "\n",
         "<div class=\"alert alert-block alert-info\">\n",
-        "    &#9432; This example can be run directly from your browser when accessed via its <a href=\"https://www.opvious.io/notebooks/retro/notebooks/?path=guides/welcome.ipynb\">opvious.io/notebooks</a> URL. No Opvious account required.\n",
+        "    &#9432; This example can be run directly from your browser when accessed via its <a href=\"https://www.opvious.io/notebooks/retro/notebooks/?path=guides/welcome.ipynb\">opvious.io/notebooks</a> URL.\n",
         "</div>\n",
         "\n",
         "Let's imagine that we are tasked with allocating a budget between various projects. We are also given an expected cost and value for each project. Our goal is to __pick projects__ which __maximize total value__ while keeping __total cost within the budget__. It turns out that our task can be formulated naturally as an [integer programming problem](https://en.wikipedia.org/wiki/Integer_programming) (it is actually an instance of the [knapsack problem](https://en.wikipedia.org/wiki/Knapsack_problem)) which--unlike heuristics--will be guaranteed to give us an optimal allocation.\n",
@@ -239,7 +239,6 @@
         "## Next steps\n",
         "\n",
         "+ Browse our other interactive [guides and examples](https://www.opvious.io/notebooks/retro)\n",
-        "+ Create a (free) account via the [Optimization Hub](https://hub.cloud.opvious.io) to solve larger problems\n",
         "+ Try the platform out locally with a [self-hosted API server](https://hub.docker.com/r/opvious/api-server)"
       ]
     },
@@ -268,7 +267,7 @@
       "name": "python",
       "nbconvert_exporter": "python",
       "pygments_lexer": "ipython3",
-      "version": "3.12.5"
+      "version": "3.12.7"
     }
   },
   "nbformat": 4,