The temporal knapsack problem and its solution

Mark Bartlett; Alan M. Frisch; Youssef Hamadi; Ian Miguel; S. 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
, S. Armagan Tarim
, Chris Unsworth

Araştırma sonucu: Dergiye katkı › Konferans makalesi › bilirkişi

39 Alıntılar (Scopus)

Özet

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.

Orijinal dil	İngilizce
Sayfa (başlangıç-bitiş)	34-48
Sayfa sayısı	15
Dergi	Lecture Notes in Computer Science
Hacim	3524
DOI'lar	https://doi.org/10.1007/11493853_5
Yayın durumu	Yayınlandı - 2005
Harici olarak yayınlandı	Evet
Etkinlik	Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2005 - Prague, !!Czech Republic Süre: 31 May 2005 → 1 Haz 2005

Belgeye Erişim

10.1007/11493853_5

Diger dosyalar ve linkler

Link to publication in Scopus

Bundan alıntı yap

@article{9a81982a260640ee998ba263cee7539f,

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\}, S. and Chris Unsworth",

year = "2005",

doi = "10.1007/11493853\_5",

language = "English",

volume = "3524",

pages = "34--48",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

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

}

TY - JOUR

T1 - The temporal knapsack problem and its solution

AU - Bartlett, Mark

AU - Frisch, Alan M.

AU - Hamadi, Youssef

AU - Miguel, Ian

AU - Armagan Tarim, S.

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.

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

U2 - 10.1007/11493853_5

DO - 10.1007/11493853_5

M3 - Conference article

AN - SCOPUS:26444445120

SN - 0302-9743

VL - 3524

SP - 34

EP - 48

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2005

Y2 - 31 May 2005 through 1 June 2005

ER -

The temporal knapsack problem and its solution

Özet

Belgeye Erişim

Diger dosyalar ve linkler

Parmak izi

Bundan alıntı yap