deploy: Jij-Inc/Jij-Docs-docusaurus@8277765b928bd13c5fdf4b3ca9c70674b2629f7e

actions-user · actions-user · commit dc25daff1ef0 · 2024-11-19T06:07:36.000Z
diff --git a/tutorial/11-graph_partitioning.ipynb b/tutorial/11-graph_partitioning.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Graph Partitioning\n",
     "\n",
-    "Here we show how to solve the graph partitioning problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve the graph partitioning problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 2.2. Graph Partitioning on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/12-clique.ipynb b/tutorial/12-clique.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Clique Problem\n",
     "\n",
-    "Here we show how to solve clique using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve clique using JijZept and JijModeling. \n",
     "This problem is also mentioned in 2.3. Clique on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/14-exact_cover.ipynb b/tutorial/14-exact_cover.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Exact Cover\n",
     "\n",
-    "Here we show how to solve the exact cover problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve the exact cover problem using JijZept and JijModeling. \n",
     "This problem is also described in 4.1. Exact Cover on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/15-set_packing.ipynb b/tutorial/15-set_packing.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Set Packing\n",
     "\n",
-    "Here we show how to solve set packing problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve set packing problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 4.2. Set Packing on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/16-vertex_cover.ipynb b/tutorial/16-vertex_cover.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Vertex Cover Problem\n",
     "\n",
-    "We show how to solve vertex cover problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/).\n",
+    "We show how to solve vertex cover problem using JijZept and JijModeling.\n",
     "This problem is also mentioned in 4.3. Vertex Cover on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/18-minimum_maximal_matching.ipynb b/tutorial/18-minimum_maximal_matching.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Minimum Maximal Matching\n",
     "\n",
-    "We show how to solve the minimum maximal matching problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "We show how to solve the minimum maximal matching problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 4.5. Minimal Maximal Matching on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/19-set_cover.ipynb b/tutorial/19-set_cover.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Set Cover\n",
     "\n",
-    "Here we show how to solve the set cover problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve the set cover problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 5.1. Set Cover on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/2-knapsack.ipynb b/tutorial/2-knapsack.ipynb
@@ -15,7 +15,7 @@
    "source": [
     "# Knapsack Problem\n",
     "\n",
-    "Here we show how to solve the knapsack problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve the knapsack problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 5.2. Knapsack with Integer Weights on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)"
    ]
   },
diff --git a/tutorial/20-hamiltonian_cycles_and_paths.ipynb b/tutorial/20-hamiltonian_cycles_and_paths.ipynb
@@ -17,7 +17,7 @@
    "source": [
     "# Hamiltonian Cycles and Paths\n",
     "\n",
-    "Here we show how to solve the Hamiltonian cycles and paths problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/).\n",
+    "Here we show how to solve the Hamiltonian cycles and paths problem using JijZept and JijModeling.\n",
     "This problem is also mentioned in 7.1. Hamiltonian Cycles and Paths on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/21-minimum_spanning_tree_with_a_maximum_degree_constraint.ipynb b/tutorial/21-minimum_spanning_tree_with_a_maximum_degree_constraint.ipynb
@@ -17,7 +17,7 @@
    "source": [
     "# Minimum Spanning Tree with a Maximum Degree Constraint\n",
     "\n",
-    "We show how to solve the minimum spanning tree problem with a maximum degree constraint using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "We show how to solve the minimum spanning tree problem with a maximum degree constraint using JijZept and JijModeling. \n",
     "This problem is also mentioned in 8.1. Minimal Spanning Tree with a Maximal Degree Constraint on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/23-directed_feedback_vertex_set.ipynb b/tutorial/23-directed_feedback_vertex_set.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Directed Feedback Vertex Set problem\n",
     "\n",
-    "Here we show how to solve directed feedback vertex set problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve directed feedback vertex set problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 8.3. Directed Feedback Vertex Set on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/26-graph_isomorphisms.ipynb b/tutorial/26-graph_isomorphisms.ipynb
@@ -16,7 +16,7 @@
    "source": [
     "# Graph Isomorphisms problem\n",
     "\n",
-    "Here we show how to solve graph isomorphisms problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve graph isomorphisms problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 9. Graph Isomorphisms on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/29_e-commerce.ipynb b/tutorial/29_e-commerce.ipynb
@@ -199,7 +199,7 @@
     "制約や目的関数の追加には、`+=`演算子を用います。  \n",
     "Jupyter Notebookであれば、実装された数理モデルを確認することができます。 -->\n",
     "\n",
-    "We can implement objective functions as a problem to maximize them by inputting [`ProblemSense.MAXIMIZE` in the `sense` argument.](https://feature-e-commerce.jij-docs-docusaurus-4sg.pages.dev/docs/jijmodeling/tutorials/creating_models/#objective-function)\n",
+    "We can implement objective functions as a problem to maximize them by inputting [`ProblemSense.MAXIMIZE` in the `sense` argument.](https://jij-inc.github.io/JijModeling-Tutorials/tutorials/creating_models.html#objective-function)\n",
     "We make two constraints with `Constraint` and use the `+=` operator to add constraints and objective functions.  \n",
     "With Jupyter Notebook, we can check the mathematical model implementaed."
    ]
@@ -442,7 +442,7 @@
     "これは、ゼロになる必要はないがなるべくゼロになってほしい、ソフト制約を表しています。  \n",
     "最後に、下位に表示されているアイテムに関しては変数を先ほどの最適化結果で固定し、上位のアイテムについてだけの最適化を行うようにしましょう。 -->\n",
     "\n",
-    "Here we utilize [`CustomPenaltyTerm` to represent the penalty term for similarity.](https://feature-e-commerce.jij-docs-docusaurus-4sg.pages.dev/docs/jijmodeling/tutorials/constraint_and_penalty/#what-is-penalty)\n",
+    "Here we utilize [`CustomPenaltyTerm` to represent the penalty term for similarity.](https://jij-inc.github.io/JijModeling-Tutorials/tutorials/constraint_and_penalty.html#what-is-penalty)\n",
     "We can use this for soft constraints, where we want that to be zero as much as possible, but not necessarily zero.\n",
     "Finally, we fix the variables for the items that appear lower positions in the optimization results before.\n",
     "We only optimize for the top positions again."
diff --git a/tutorial/6-number_partition.ipynb b/tutorial/6-number_partition.ipynb
@@ -15,7 +15,7 @@
    "source": [
     "# Number Partitioning\n",
     "\n",
-    "Here we show how to solve the number partitioning problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",
+    "Here we show how to solve the number partitioning problem using JijZept and JijModeling. \n",
     "This problem is also mentioned in 2.1. Number Partitioning on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."
    ]
   },
diff --git a/tutorial/mps.ipynb b/tutorial/mps.ipynb
@@ -184,9 +184,9 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "<!-- この`load`は、[JijModelingの`Problem`](https://www.documentation.jijzept.com/docs/jijmodelingtranspiler/references/jijmodeling_transpiler/core/compile/compiled_model#class-problem)と、それに対応したインスタンスデータを戻り値として返します。そのため、Jupyter Notebook上であれば、実際にどのような数理モデルが読み込まれたかを確認することができます。 -->\n",
+    "<!-- この`load`は、[JijModelingの`Problem`](https://jij-inc.github.io/JijModeling-Tutorials/apis/jijmodeling/#class-problem)と、それに対応したインスタンスデータを戻り値として返します。そのため、Jupyter Notebook上であれば、実際にどのような数理モデルが読み込まれたかを確認することができます。 -->\n",
     "\n",
-    "`load` returns [JijModeling `Problem`](https://www.documentation.jijzept.com/docs/jijmodelingtranspiler/references/jijmodeling_transpiler/core/compile/compiled_model#class-problem) and the corresponding instance data.  \n",
+    "`load` returns [JijModeling `Problem`](https://jij-inc.github.io/JijModeling-Tutorials/apis/jijmodeling/#class-problem) and the corresponding instance data.  \n",
     "With Jupyter Notebook, we can check the mathematical model loaded."
    ]
   },

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@`
`16`	`16`	`"source": [`
`17`	`17`	`"# Graph Partitioning\n",`
`18`	`18`	`"\n",`
`19`		`- "Here we show how to solve the graph partitioning problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",`
	`19`	`+ "Here we show how to solve the graph partitioning problem using JijZept and JijModeling. \n",`
`20`	`20`	`"This problem is also mentioned in 2.2. Graph Partitioning on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."`
`21`	`21`	`]`
`22`	`22`	`},`
Original file line number	Diff line number	Diff line change
`@@ -15,7 +15,7 @@`
`15`	`15`	`"source": [`
`16`	`16`	`"# Knapsack Problem\n",`
`17`	`17`	`"\n",`
`18`		`- "Here we show how to solve the knapsack problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/). \n",`
	`18`	`+ "Here we show how to solve the knapsack problem using JijZept and JijModeling. \n",`
`19`	`19`	`"This problem is also mentioned in 5.2. Knapsack with Integer Weights on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)"`
`20`	`20`	`]`
`21`	`21`	`},`
Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@`
`17`	`17`	`"source": [`
`18`	`18`	`"# Hamiltonian Cycles and Paths\n",`
`19`	`19`	`"\n",`
`20`		`- "Here we show how to solve the Hamiltonian cycles and paths problem using JijZept and [JijModeling](https://www.ref.documentation.jijzept.com/jijmodeling/).\n",`
	`20`	`+ "Here we show how to solve the Hamiltonian cycles and paths problem using JijZept and JijModeling.\n",`
`21`	`21`	`"This problem is also mentioned in 7.1. Hamiltonian Cycles and Paths on [Lucas, 2014, \"Ising formulations of many NP problems\"](https://www.frontiersin.org/articles/10.3389/fphy.2014.00005/full)."`
`22`	`22`	`]`
`23`	`23`	`},`