Discrete resource allocation to groups of customers
The paper deals with the non-homogeny discrete resource allocation to groups of customers with non-linear profit functions. The fast hierarchical greedy algorithms are presented and investigated. The exact upper boundwas found for complexity of the algorithm. The experiments prove the advantage of...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
2005-12-01
|
| Series: | Lietuvos Matematikos Rinkinys |
| Subjects: | |
| Online Access: | https://www.journals.vu.lt/LMR/article/view/27396 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832593232461037568 |
|---|---|
| author | Vytautas Tiešis |
| author_facet | Vytautas Tiešis |
| author_sort | Vytautas Tiešis |
| collection | DOAJ |
| description |
The paper deals with the non-homogeny discrete resource allocation to groups of customers with non-linear profit functions. The fast hierarchical greedy algorithms are presented and investigated. The exact upper boundwas found for complexity of the algorithm. The experiments prove the advantage of the modification of the algorithm.
|
| format | Article |
| id | doaj-art-ecb1b0e84eb941a9ad11d1d889285610 |
| institution | Kabale University |
| issn | 0132-2818 2335-898X |
| language | English |
| publishDate | 2005-12-01 |
| publisher | Vilnius University Press |
| record_format | Article |
| series | Lietuvos Matematikos Rinkinys |
| spelling | doaj-art-ecb1b0e84eb941a9ad11d1d8892856102025-01-20T18:15:47ZengVilnius University PressLietuvos Matematikos Rinkinys0132-28182335-898X2005-12-0145spec.10.15388/LMR.2005.27396Discrete resource allocation to groups of customersVytautas Tiešis0Institute of Mathematics and Informatics The paper deals with the non-homogeny discrete resource allocation to groups of customers with non-linear profit functions. The fast hierarchical greedy algorithms are presented and investigated. The exact upper boundwas found for complexity of the algorithm. The experiments prove the advantage of the modification of the algorithm. https://www.journals.vu.lt/LMR/article/view/27396discrete optimisationgreedy algorithmsresource allocation |
| spellingShingle | Vytautas Tiešis Discrete resource allocation to groups of customers Lietuvos Matematikos Rinkinys discrete optimisation greedy algorithms resource allocation |
| title | Discrete resource allocation to groups of customers |
| title_full | Discrete resource allocation to groups of customers |
| title_fullStr | Discrete resource allocation to groups of customers |
| title_full_unstemmed | Discrete resource allocation to groups of customers |
| title_short | Discrete resource allocation to groups of customers |
| title_sort | discrete resource allocation to groups of customers |
| topic | discrete optimisation greedy algorithms resource allocation |
| url | https://www.journals.vu.lt/LMR/article/view/27396 |
| work_keys_str_mv | AT vytautastiesis discreteresourceallocationtogroupsofcustomers |