Algorithmics of the knapsack type tasks

A tétel rövid nézete
dc.contributor.authorPătcaş, Csaba
dc.contributor.authorIonescu, Klára
dc.date.accessioned2024-09-04T09:46:04Z
dc.date.available2024-09-04T09:46:04Z
dc.date.issued2008-12-31
dc.description.abstractWe propose a new kind of approach of the teaching of knapsack type problems in the classroom. We will remind you the context of the general knapsack-task and we will classify it, including the two most popular task variants: the discrete and the continuous one. Once we briefly present the solving algorithm of the continuous variant, we will focus on the solving of the discrete task, and we will determine the complexity of the algorithms, looking for different optimizing possibilities. All these issues are presented in a useful way for highschool teachers, who are preparing students in order to participate in different programming contests.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 6 No. ID (2008) , 37-71
dc.identifier.doihttps://doi.org/10.5485/TMCS.2008.R008
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issueID
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379650
dc.identifier.volume6
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14840
dc.rights.accessOpen Access
dc.rights.ownerCsaba Pătcaş and Klára Ionescu
dc.subjectteachingen
dc.subjectalgorithmen
dc.subjectknapsacken
dc.subjectdynamic programming methoden
dc.subjectoptimizationen
dc.subjectreporten
dc.titleAlgorithmics of the knapsack type tasksen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
300.67 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)