Knapsack problem - An illustrative example

A tétel rövid nézete
dc.contributor.advisorRácz, Anett
dc.contributor.authorBogdan, Anastasia
dc.contributor.departmentDE--Informatikai Kar
dc.date.accessioned2025-06-30T14:09:54Z
dc.date.available2025-06-30T14:09:54Z
dc.date.created2025-04-10
dc.description.abstractIn large amusement parks like Europa Park, it is difficult for visitors to accurately plan their time while considering all restrictions. Visitors may face the challenge of choosing attractions that balance fun with safety and practicality, taking into account factors such as age, height, pregnancy restrictions, and accessibility for people with disabilities. With so many options available, optimizing the experience for each unique visitor becomes a significant task. The goal of this thesis is to apply the Knapsack problem to optimize amusement park visits by selecting the most enjoyable attractions within limited time or budget. This approach is important as it enhances decision-making in real-life situations where constraints exist.
dc.description.courseGazdaságinformatikus
dc.description.degreeBSc/BA
dc.format.extent63
dc.identifier.urihttps://hdl.handle.net/2437/395111
dc.language.isoen
dc.rights.infoHozzáférhető a 2022 decemberi felsőoktatási törvénymódosítás értelmében.
dc.subjectOperations research, Knapsack Problem, Python, Pyomo
dc.subject.dspaceInformatics
dc.subject.dspaceInformatics::Applied Mathematics
dc.titleKnapsack problem - An illustrative example
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
Thesis.pdf
Méret:
993.63 KB
Formátum:
Adobe Portable Document Format
Leírás:
thesis
Megjelenítés
Engedélyek köteg
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
license.txt
Méret:
1.95 KB
Formátum:
Item-specific license agreed upon to submission
Leírás:
Letöltés
Gyűjtemények
Theses (IK)