✦ LIBER ✦

New Heuristics for the Multidimensional Vote Assignment Problem

✍ Scribed by P. Kleinschmidt; C. Rank

Publisher: Springer Vienna
Year: 1999
Tongue: English
Weight: 133 KB
Volume: 63
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s006070050041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for the multi-resource genera

Heuristics for the multi-resource generalized assignment problem

✍ Joseph B. Mazzola; Steven P. Wilcox 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

Relaxation heuristics for a generalized

Relaxation heuristics for a generalized assignment problem

✍ Luiz Antonio N. Lorena; Marcelo G. Narciso 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 545 KB

Improved convergent heuristics for the 0

Improved convergent heuristics for the 0-1 multidimensional knapsack problem

✍ Saïd Hanafi; Christophe Wilbaut 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 406 KB

A hybrid heuristic for the generalized a

A hybrid heuristic for the generalized assignment problem

✍ Mohammad M. Amini; Michael Racer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 344 KB

LP based heuristics for the multiple kna

LP based heuristics for the multiple knapsack problem with assignment restrictions

✍ Geir Dahl; Njål Foldnes 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 346 KB

On the Task Assignment Problem: Two New

On the Task Assignment Problem: Two New Efficient Heuristic Algorithms

✍ Y. Kopidakis; M. Lamari; V. Zissimopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 156 KB

We study the problem of task allocation in heterogeneous distributed systems. The objective is the minimization of the sum of processor execution and intertask communication costs. We transform the problem to a maximization one, where we try to determine and avoid large communication costs and ineff