5263 search results - page 163 / 1053 » Open Constraint Optimization |
106
Voted
AMC
2005
15 years 3 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
162
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
131
Voted
MP
1998
15 years 3 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)} ...
126
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
118
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...