build based on 89a581e

Author: Documenter.jl

dev/.documenter-siteinfo.json

@@ -1 +1 @@
-{"documenter":{"julia_version":"1.12.4","generation_timestamp":"2026-01-12T08:15:15","documenter_version":"1.16.1"}}
+{"documenter":{"julia_version":"1.12.5","generation_timestamp":"2026-03-03T14:55:11","documenter_version":"1.17.0"}}

dev/api/index.html

@@ -37,7 +37,40 @@ function maybeAddWarning() {
   closer.addEventListener("click", function () {
     document.body.removeChild(div);
   });
-  const href = window.documenterBaseURL + "/../" + window.DOCUMENTER_STABLE;
+  var target_href =
+    window.documenterBaseURL + "/../" + window.DOCUMENTER_STABLE;
+
+  // try to stay on the same page when linking to the stable version
+  // get the current page path relative to the version root
+  var current_page = window.location.pathname;
+
+  // resolve the documenterBaseURL to an absolute path
+  // documenterBaseURL is a relative path (usually "."), so we need to resolve it
+  var base_url_absolute = new URL(documenterBaseURL, window.location.href)
+    .pathname;
+  if (!base_url_absolute.endsWith("/")) {
+    base_url_absolute = base_url_absolute + "/";
+  }
+
+  // extract the page path after the version directory
+  // e.g., if we're on /stable/man/guide.html, we want "man/guide.html"
+  var page_path = "";
+  if (current_page.startsWith(base_url_absolute)) {
+    page_path = current_page.substring(base_url_absolute.length);
+  }
+
+  // construct the target URL with the same page path
+  var target_url = target_href;
+  if (page_path && page_path !== "" && page_path !== "index.html") {
+    // ensure target_href ends with a slash before appending page path
+    if (!target_url.endsWith("/")) {
+      target_url = target_url + "/";
+    }
+    target_url = target_url + page_path;
+  }
+
+  // preserve the anchor (hash) from the current page
+  var current_hash = window.location.hash;
 
   // Determine if this is a development version or an older release
   let warningMessage = "";
@@ -51,12 +84,35 @@ function maybeAddWarning() {
       "This documentation is for an <strong>older version</strong> that may be missing recent changes.<br>";
   }
 
-  warningMessage +=
-    '<a href="' +
-    href +
-    '">Click here to go to the documentation for the latest stable release.</a>';
+  // Create the link element with same-page navigation
+  const link = document.createElement("a");
+  link.href = target_url + current_hash;
+  link.textContent =
+    "Click here to go to the documentation for the latest stable release.";
+
+  // If we're trying to stay on the same page, verify it exists first
+  if (page_path && page_path !== "" && page_path !== "index.html") {
+    link.addEventListener("click", function (e) {
+      e.preventDefault();
+      // check if the target page exists, fallback to homepage if it doesn't
+      fetch(target_url, { method: "HEAD" })
+        .then(function (response) {
+          if (response.ok) {
+            window.location.href = target_url + current_hash;
+          } else {
+            // page doesn't exist in the target version, go to homepage
+            window.location.href = target_href;
+          }
+        })
+        .catch(function (error) {
+          // network error or other failure - use homepage
+          window.location.href = target_href;
+        });
+    });
+  }
 
   div.innerHTML = warningMessage;
+  div.appendChild(link);
   div.appendChild(closer);
   document.body.appendChild(div);
 }

dev/assets/documenter.js

@@ -39,4 +39,4 @@
 reset!(env::AbstractEnvironment; reset_rng::Bool, seed=get_seed(env))  # Reset to initial state
 observe(env::AbstractEnvironment) -> (obs, info)    # Get current observation  
 step!(env::AbstractEnvironment, action) -> reward   # Take action, get reward
-is_terminated(env::AbstractEnvironment) -&gt; Bool     # Check if episode ended</code></pre></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../">« Getting started</a><a class="docs-footer-nextpage" href="../warcraft_tutorial/">Path-finding on image maps »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.16.1 on <span class="colophon-date" title="Monday 12 January 2026 08:15">Monday 12 January 2026</span>. Using Julia version 1.12.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+is_terminated(env::AbstractEnvironment) -&gt; Bool     # Check if episode ended</code></pre></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../">« Getting started</a><a class="docs-footer-nextpage" href="../warcraft_tutorial/">Path-finding on image maps »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.17.0 on <span class="colophon-date" title="Tuesday 3 March 2026 14:55">Tuesday 3 March 2026</span>. Using Julia version 1.12.5.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>

dev/assets/warner.js

@@ -3,4 +3,4 @@
 \fbox{Neural network $\varphi_w$}
 \xrightarrow[\text{Prizes}]{\theta}
 \fbox{Prize-collecting VSP}
-\xrightarrow[\text{Routes}]{a_t}\]</p><p><strong>Components</strong>:</p><ol><li><strong>Neural Network</strong> <span>$\varphi_w$</span>: Takes current state features as input and predicts customer prizes <span>$\theta = (\theta_1, \ldots, \theta_n)$</span>, one value per postponable customer.</li><li><strong>Optimization Layer</strong>: Solves the prize-collecting vehicle scheduling problem to determine optimal routes given the predicted prizes, by maximizing total collected prizes minus travel costs:  <code>math  \max_{a_t\in \mathcal{A}(s_t)} \sum_{r \in a_t} \left( \sum_{i \in r} \theta_i - \sum_{(i,j) \in r} d_{ij} \right)</code>  This can be modeled as a flow linear program on a directed acyclic graph (DAG) and is solved using standard LP solvers.</li></ol><p>The neural network architecture adapts to the feature dimensionality:</p><ul><li><strong>2D features</strong>: <code>Dense(2 =&gt; 1)</code>, applied in parallel to each postponable customer</li><li><strong>Full features</strong>: <code>Dense(27 =&gt; 1)</code> applied in parallel to each postponable customer</li></ul><p><strong>Note:</strong> one can also use more complex architectures such as a deeper MLP or a graph neural network for better performance.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../argmax/">« Argmax</a><a class="docs-footer-nextpage" href="../dynamic_assortment/">Dynamic Assortment »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.16.1 on <span class="colophon-date" title="Monday 12 January 2026 08:15">Monday 12 January 2026</span>. Using Julia version 1.12.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+\xrightarrow[\text{Routes}]{a_t}\]</p><p><strong>Components</strong>:</p><ol><li><strong>Neural Network</strong> <span>$\varphi_w$</span>: Takes current state features as input and predicts customer prizes <span>$\theta = (\theta_1, \ldots, \theta_n)$</span>, one value per postponable customer.</li><li><strong>Optimization Layer</strong>: Solves the prize-collecting vehicle scheduling problem to determine optimal routes given the predicted prizes, by maximizing total collected prizes minus travel costs:  <code>math  \max_{a_t\in \mathcal{A}(s_t)} \sum_{r \in a_t} \left( \sum_{i \in r} \theta_i - \sum_{(i,j) \in r} d_{ij} \right)</code>  This can be modeled as a flow linear program on a directed acyclic graph (DAG) and is solved using standard LP solvers.</li></ol><p>The neural network architecture adapts to the feature dimensionality:</p><ul><li><strong>2D features</strong>: <code>Dense(2 =&gt; 1)</code>, applied in parallel to each postponable customer</li><li><strong>Full features</strong>: <code>Dense(27 =&gt; 1)</code> applied in parallel to each postponable customer</li></ul><p><strong>Note:</strong> one can also use more complex architectures such as a deeper MLP or a graph neural network for better performance.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../argmax/">« Argmax</a><a class="docs-footer-nextpage" href="../dynamic_assortment/">Dynamic Assortment »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.17.0 on <span class="colophon-date" title="Tuesday 3 March 2026 14:55">Tuesday 3 March 2026</span>. Using Julia version 1.12.5.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>

dev/benchmark_interfaces/index.html

@@ -9,4 +9,4 @@
 \fbox{Neural network $\varphi_w$}
 \xrightarrow[\text{Cost vector}]{\theta}
 \fbox{Top K}
-\xrightarrow[\text{Assortment}]{a_t}\]</p><p><strong>Components</strong>:</p><ol><li><strong>Neural Network</strong> <span>$\varphi_w$</span>: Takes the current state <span>$s_t$</span> as input and predicts item utilities <span>$\theta = (\theta_1, \ldots, \theta_N)$</span></li><li><strong>Optimization Layer</strong>: Selects the top <span>$K$</span> items with highest predicted utilities to form the assortment <span>$a_t$</span></li></ol><h2 id="Reference"><a class="docs-heading-anchor" href="#Reference">Reference</a><a id="Reference-1"></a><a class="docs-heading-anchor-permalink" href="#Reference" title="Permalink"></a></h2><p>Based on the paper: <a href="https://arxiv.org/abs/2505.19053">Structured Reinforcement Learning for Combinatorial Decision-Making</a></p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../dvsp/">« Dynamic Vehicle Scheduling</a><a class="docs-footer-nextpage" href="../fixed_size_shortest_path/">Shortest paths »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.16.1 on <span class="colophon-date" title="Monday 12 January 2026 08:15">Monday 12 January 2026</span>. Using Julia version 1.12.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+\xrightarrow[\text{Assortment}]{a_t}\]</p><p><strong>Components</strong>:</p><ol><li><strong>Neural Network</strong> <span>$\varphi_w$</span>: Takes the current state <span>$s_t$</span> as input and predicts item utilities <span>$\theta = (\theta_1, \ldots, \theta_N)$</span></li><li><strong>Optimization Layer</strong>: Selects the top <span>$K$</span> items with highest predicted utilities to form the assortment <span>$a_t$</span></li></ol><h2 id="Reference"><a class="docs-heading-anchor" href="#Reference">Reference</a><a id="Reference-1"></a><a class="docs-heading-anchor-permalink" href="#Reference" title="Permalink"></a></h2><p>Based on the paper: <a href="https://arxiv.org/abs/2505.19053">Structured Reinforcement Learning for Combinatorial Decision-Making</a></p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../dvsp/">« Dynamic Vehicle Scheduling</a><a class="docs-footer-nextpage" href="../fixed_size_shortest_path/">Shortest paths »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.17.0 on <span class="colophon-date" title="Tuesday 3 March 2026 14:55">Tuesday 3 March 2026</span>. Using Julia version 1.12.5.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>