The Temporal Knapsack Problem and Its Solution

Mark Bartlett; Alan M. Frisch; Youssef Hamadi; Ian Miguel; Armagan Tarim; Chris Unsworth

doi:10.1007/11493853_5

The Temporal Knapsack Problem and Its Solution

Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth

Computer Science

Research output: Contribution to conference › Paper › peer-review

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	Undefined/Unknown
Pages	34-48
DOIs	https://doi.org/10.1007/11493853_5
Publication status	Published - 2005

Access to Document

10.1007/11493853_5

http://dx.doi.org/10.1007/11493853_5

Cite this

@conference{75e93217aa2047eab2f3bc436df755f6,

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 = "Mark Bartlett and Frisch, {Alan M.} and Youssef Hamadi and Ian Miguel and Armagan Tarim and Chris Unsworth",

year = "2005",

doi = "10.1007/11493853_5",

language = "Undefined/Unknown",

pages = "34--48",

}

TY - CONF

T1 - The Temporal Knapsack Problem and Its Solution

AU - Bartlett, Mark

AU - Frisch, Alan M.

AU - Hamadi, Youssef

AU - Miguel, Ian

AU - Tarim, Armagan

AU - Unsworth, Chris

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.

U2 - 10.1007/11493853_5

DO - 10.1007/11493853_5

M3 - Paper

SP - 34

EP - 48

ER -