From ec0c0bd1acee5e0ea2d7ef076b69d7e454d784bf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Fabiana=20=20=E2=9A=A1=EF=B8=8F=20Campanari?=
<113218619+FabianaCampanari@users.noreply.github.com>
Date: Sun, 3 Aug 2025 14:09:56 -0300
Subject: [PATCH] Update README.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Signed-off-by: Fabiana ⚡️ Campanari <113218619+FabianaCampanari@users.noreply.github.com>
---
README.md | 7 +++----
1 file changed, 3 insertions(+), 4 deletions(-)
diff --git a/README.md b/README.md
index 8b4bdf9..8bc23dd 100644
--- a/README.md
+++ b/README.md
@@ -2355,7 +2355,6 @@ After running Solver, you should get a solution like:
- [Task 2]() → **Machine 3** (cost 2)
- [Task 3]() → **Machine 2** (cost 2)
-
**Total minimum cost:** [6]().
@@ -2385,9 +2384,9 @@ After running Solver, you should get a solution like:
#### [Step 4.1](): Result
**The optimal assignment is:**
-- Task 1 to Machine 1 (cost 2)
-- Task 2 to Machine 3 (cost 2)
-- Task 3 to Machine 2 (cost 2)
+- [Task 1]() to Machine 1 (cost 2)
+- [Task 2]() to Machine 3 (cost 2)
+- [Task 3]() to Machine 2 (cost 2)