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

Research output: Book/Report › Book

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
Publisher	Unknown Publisher
Number of pages	15
Publication status	Published - 2005

Cite this

@book{9594044b712946ac9766d4aeab769714,

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

publisher = "Unknown Publisher",

}

TY - BOOK

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.

UR - https://www.scopus.com/pages/publications/26444445120

M3 - Book

BT - The temporal knapsack problem and its solution

PB - Unknown Publisher

ER -

The temporal knapsack problem and its solution

Abstract

Other files and links

Fingerprint

Cite this