Settling Multiple Debts Efficiently: An Invitation to Computing Science
I present and solve several problems related to the settling of multiple debts. The solutions are documented in much detail, with (bright) high-school students in mind. One of the variants has a simple solution, though it is not so easy to code concisely. Another variant is an elegant NP-hard proble...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University
2004-04-01
|
| Series: | Informatics in Education |
| Subjects: | |
| Online Access: | http://www.mii.lt/informatics_in_education/pdf/INFE023.pdf |
| id |
doaj-c4d66e9896804b0f9c3007d07968c998 |
|---|---|
| record_format |
Article |
| spelling |
doaj-c4d66e9896804b0f9c3007d07968c9982021-01-02T04:02:16ZengVilnius UniversityInformatics in Education1648-58312004-04-0131105126Settling Multiple Debts Efficiently: An Invitation to Computing ScienceTom VERHOEFF0Faculty of Mathematics and Computing Science, Eindhoven University of Technology Den Dolech 2, NL-5612 AZ, Eindhoven, The Netherlands I present and solve several problems related to the settling of multiple debts. The solutions are documented in much detail, with (bright) high-school students in mind. One of the variants has a simple solution, though it is not so easy to code concisely. Another variant is an elegant NP-hard problem. The problem leads into important areas of mathematics and computing science, making it suitable as an invitation to these subjects.http://www.mii.lt/informatics_in_education/pdf/INFE023.pdfcomputing science educationcombinatorial optimizationbalanced transportation problemuncapacitated fixed-charge network flowNP-completeness |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Tom VERHOEFF |
| spellingShingle |
Tom VERHOEFF Settling Multiple Debts Efficiently: An Invitation to Computing Science Informatics in Education computing science education combinatorial optimization balanced transportation problem uncapacitated fixed-charge network flow NP-completeness |
| author_facet |
Tom VERHOEFF |
| author_sort |
Tom VERHOEFF |
| title |
Settling Multiple Debts Efficiently: An Invitation to Computing Science |
| title_short |
Settling Multiple Debts Efficiently: An Invitation to Computing Science |
| title_full |
Settling Multiple Debts Efficiently: An Invitation to Computing Science |
| title_fullStr |
Settling Multiple Debts Efficiently: An Invitation to Computing Science |
| title_full_unstemmed |
Settling Multiple Debts Efficiently: An Invitation to Computing Science |
| title_sort |
settling multiple debts efficiently: an invitation to computing science |
| publisher |
Vilnius University |
| series |
Informatics in Education |
| issn |
1648-5831 |
| publishDate |
2004-04-01 |
| description |
I present and solve several problems related to the settling of multiple debts. The solutions are documented in much detail, with (bright) high-school students in mind. One of the variants has a simple solution, though it is not so easy to code concisely. Another variant is an elegant NP-hard problem.
The problem leads into important areas of mathematics and computing science, making it suitable as an invitation to these subjects. |
| topic |
computing science education combinatorial optimization balanced transportation problem uncapacitated fixed-charge network flow NP-completeness |
| url |
http://www.mii.lt/informatics_in_education/pdf/INFE023.pdf |
| work_keys_str_mv |
AT tomverhoeff settlingmultipledebtsefficientlyaninvitationtocomputingscience |
| _version_ |
1724360780500959232 |