658 search results - page 14 / 132 » Partially Ordered Constraint Optimization Problems |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
MP
1998
13 years 7 months ago
1998
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
CP
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
DGCI
2009
Springer
13 years 10 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...