start adding some description in the documenttaion for each benchmark pb

docs/make.jl

@@ -21,7 +21,13 @@ makedocs(;
     format=Documenter.HTML(),
     pages=[
         "Home" => "index.md",
-        "Tutorials" => md_tutorial_files,
+        # "Tutorials" => md_tutorial_files,
+        "Benchmark problems list" => [
+            "benchmarks/subset_selection.md",
+            "benchmarks/portfolio_optimization.md",
+            "benchmarks/fixed_size_shortest_path.md",
+            "benchmarks/warcraft.md",
+        ],
         "API reference" =>
             ["api/interface.md", "api/decision_focused.md", "api/warcraft.md"],
     ],

docs/src/benchmarks/fixed_size_shortest_path.md

@@ -0,0 +1,3 @@
+# Shortest paths
+
+[`FixedSizeShortestPathBenchmark`](@ref)

docs/src/benchmarks/portfolio_optimization.md

@@ -0,0 +1,3 @@
+# Portfolio Optimization
+
+[`PortfolioOptimizationBenchmark`](@ref)

docs/src/benchmarks/subset_selection.md

@@ -0,0 +1,9 @@
+# Subset Selection
+
+[`SubsetSelectionBenchmark`](@ref) is a very simple benchmark problem of subset selection.
+
+We have a set of ``n`` items, each item having an `unknown' value.
+We want to select a subset of ``k`` items that maximizes the sum of the values of the selected items.
+
+As input, we are given a feature vector, that contains exactly the value of each item.
+The goal is to learn the identity mapping between the feature vector and the value of the items.

docs/src/benchmarks/warcraft.md

@@ -0,0 +1,3 @@
+# Warcraft
+
+[`WarcraftBenchmark`](@ref)