From 563dea016f5d6a6431224e9f5af719570da101e5 Mon Sep 17 00:00:00 2001
From: Pamela Dyer <pamela.dyer@uconn.edu>
Date: Sun, 26 Dec 2021 15:44:10 -0800
Subject: [PATCH] Update Knapsack_Weight_Limit.mp

---
 models/Application_examples/Knapsack_Weight_Limit.mp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/models/Application_examples/Knapsack_Weight_Limit.mp b/models/Application_examples/Knapsack_Weight_Limit.mp
index 2404923..45d1426 100644
--- a/models/Application_examples/Knapsack_Weight_Limit.mp
+++ b/models/Application_examples/Knapsack_Weight_Limit.mp
@@ -11,7 +11,7 @@
 │*│ │ optimal solutions in a certain scope, with a limit │ │
 │*│ │ set for the weight of the knapsack.                │ │
 │*│ └────────────────────────────────────────────────────┘ │
-│*│														   │
+│*│                                                        │
 │*│ ┌─[ Description ]────────────────────────────────────┐ │
 │*│ │ This is a case of well-known Knapsack Dynamic      │ │
 │*│ │ Programming Problem. In general it is NP-hard and  │ │
-- 
GitLab