121 search results - page 16 / 25 » Optimal Group Manipulation in Facility Location Problems |
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
104
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...