The temporal knapsack problem and its solution

M Bartlett; A M Frisch; Y Hamadi; I Miguel; S A Tarim; C Unsworth

The temporal knapsack problem and its solution

M Bartlett, A M Frisch, Y Hamadi, I Miguel, S A Tarim, C Unsworth

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS
Editors	R Bartak, M Milano
Place of Publication	BERLIN
Publisher	Springer
Pages	34-48
Number of pages	15
ISBN (Print)	3-540-26152-4
Publication status	Published - 2005
Event	2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - Prague Duration: 30 May 2005 → 1 Jun 2005

Conference

Conference	2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
City	Prague
Period	30/05/05 → 1/06/05

Cite this

@inproceedings{a0ac222e86db45998b8930aff80ede0a,

title = "The temporal knapsack problem and its solution",

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.",

author = "M Bartlett and Frisch, {A M} and Y Hamadi and I Miguel and Tarim, {S A} and C Unsworth",

year = "2005",

language = "English",

isbn = "3-540-26152-4",

pages = "34--48",

editor = "R Bartak and M Milano",

booktitle = "INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS",

publisher = "Springer",

address = "Germany",

note = "2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; Conference date: 30-05-2005 Through 01-06-2005",

}

Bartlett, M , Frisch, AM, Hamadi, Y, Miguel, I, Tarim, SA & Unsworth, C 2005, The temporal knapsack problem and its solution. in R Bartak & M Milano (eds), INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS. Springer, BERLIN, pp. 34-48, 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Prague, 30/05/05.

TY - GEN

T1 - The temporal knapsack problem and its solution

AU - Bartlett, M

AU - Frisch, A M

AU - Hamadi, Y

AU - Miguel, I

AU - Tarim, S A

AU - Unsworth, C

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

M3 - Conference contribution

SN - 3-540-26152-4

SP - 34

EP - 48

BT - INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS

A2 - Bartak, R

A2 - Milano, M

PB - Springer

CY - BERLIN

T2 - 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Y2 - 30 May 2005 through 1 June 2005

ER -