2109 search results - page 130 / 422 » Solving Necklace Constraint Problems |
124
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
162
click to vote
EOR
2010
15 years 6 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
146
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
141
click to vote
SIAMJO
2010
15 years 23 days ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
134
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...