2978 search results - page 90 / 596 » Operations Research |
103
click to vote
MOR
2002
15 years 2 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
137
click to vote
CPC
2010
15 years 16 days ago
2010
Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . . + rm = c1 + . . . + cn. We consider the set (R, C) of non-negative m
117
click to vote
ORL
2010
14 years 10 months ago
2010
We show a robot vacuum using a protocol that next cleans the "dirtiest" incident edge may take exponential time to clean a network. This disproves a conjecture of Messing...
128
click to vote
ORL
2010
14 years 10 months ago
2010
Abstract. We formulate the multiperiod, distribution-free perishable inventory problem as a problem of prediction with expert advice and apply an online learning method (the Weak A...