The temporal knapsack problem and its solution (2005)
Cached
Download Links
- [www.dcs.st-and.ac.uk]
- [research.microsoft.com]
- [4c.ucc.ie]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 2 d International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Bartlett05thetemporal,
author = {Mark Bartlett and Alan M. Frisch and Youssef Hamadi and Ian Miguel and S. Armagan Tarim and Chris Unsworth},
title = {The temporal knapsack problem and its solution},
booktitle = {In Proceedings of the 2 d International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems},
year = {2005},
pages = {34--48}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a multiprocessor to bids for the resources. The algorithms considered use and combine techniques from constraint programming, artificial intelligence and operations research. 1
