From d348444033fc5f6656d6f7bea2ec7dc82290e513 Mon Sep 17 00:00:00 2001
From: Americo Cunha <36556019+americocunhajr@users.noreply.github.com>
Date: Tue, 13 Aug 2024 22:33:23 -0300
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 5d8f049..e4a87ed 100644
--- a/README.md
+++ b/README.md
@@ -191,7 +191,7 @@ end
 The CE method, which underpins the CEopt package, is inherently stochastic. This means that each run of the optimization process might follow a different trajectory towards the optimum due to the random sampling involved in the method. Therefore, it is entirely normal for repeated executions of the same optimization task to yield different paths or convergence profiles. Users are encouraged to consider multiple runs or adjust the `sigma0` parameter to manage the exploration-exploitation balance and potentially achieve more consistent results.
 
 ### Reproducibility
-The tutorials of **CEopt** package are fully reproducible. You can find a fully reproducible capsule of the simulations on <a href="https://codeocean.com/capsule/xxx" target="_blank">CodeOcean</a>.
+The tutorials of **CEopt** package are fully reproducible. You can find a fully reproducible capsule of the simulations on <a href="https://codeocean.com/capsule/0007851/tree" target="_blank">CodeOcean</a>.
 
 ### Documentation
 The routines in **CEopt** package are well-commented to explain their functionality. Each routine includes a description of its purpose, as well as inputs and outputs. Detailed documentation about the code functionality can be found in paper.