3 search results - page 1 / 1 » Distributed Lagrangean relaxation protocol for the generaliz... |
94
Voted
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
88
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
AAAI
2006
14 years 10 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...