The temporal knapsack problem and its solution

Authors:
Mark Bartlett;Alan M. Frisch;Youssef Hamadi;Ian Miguel;S. Armagan Tarim;Chris Unsworth
Affiliations:
Artificial Intelligence Group, Dept. of Computer Science, Univ. of York, York, UK;Artificial Intelligence Group, Dept. of Computer Science, Univ. of York, York, UK;Microsoft Research Ltd., Cambridge, UK;School of Computer Science, University of St Andrews, St Andrews, UK;Cork Constraint Computation Centre, Univ. of Cork, Cork, Ireland;Department of Computing Science, University of Glasgow, UK
Venue:
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2005

Citing 5
Cited 3

Principles of artificial intelligence

Principles of artificial intelligence
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Efficient memory-bounded search methods

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
MIP: Theory and Practice - Closing the Gap

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications

Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
Resource allocation with time intervals

Theoretical Computer Science
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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.