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!
|