Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use actions-gh-pages #725

Merged
merged 1 commit into from
Nov 1, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 3 additions & 6 deletions .github/workflows/docs.yml
Original file line number Diff line number Diff line change
Expand Up @@ -53,14 +53,11 @@ jobs:
- name: Render Quarto Project
run: pixi run quarto-render

- name: Set up Quarto for publish
uses: quarto-dev/quarto-actions/setup@v2
- name: Publish Quarto Project
if: github.ref == 'refs/heads/main'
uses: quarto-dev/quarto-actions/publish@v2
uses: peaceiris/actions-gh-pages@v3
with:
path: docs
render: false
target: gh-pages
github_token: ${{ secrets.GITHUB_TOKEN }}
publish_dir: ./docs
env:
GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
4 changes: 2 additions & 2 deletions docs/core/allocation.qmd
Original file line number Diff line number Diff line change
Expand Up @@ -140,12 +140,12 @@ $$
\hat{V}^{\text{out}}_S(\hat{k}) = \{\hat{j}\}.
\end{align}
$$ {#eq-returnflowconstraint}
Here we use that each user node in the allocation graph has an unique in-edge and out-edge.
Here we use that each user node in the allocation graph has a unique in-edge and out-edge.
- User allocation: The flow over the edge to the user is equal to the sum of the allocations to the user:
$$
F_{\hat{i}\hat{k}} = \sum_{p=1}^{p_\max} A^\text{user}_{\hat{k},p}, \quad \forall \hat{k} \in \hat{U}_S, \hat{V}^{\text{out}}_s(\hat{k}) = \{\hat{i}\}.
$$ {#eq-userallocationconstraint}
Here we use that each user has an unique out-edge.
Here we use that each user has a unique out-edge.
- User demand: what is allocated to the user is bounded above by the user demand:
$$
A_{\hat{i},p}^\text{user} \leq d_i^p(t) \quad \forall\hat{i} \in \hat{U}_S, \; p = 1,\ldots,p_\max.
Expand Down