29 search results - page 4 / 6 » orl 2010 |
ORL
2010
13 years 4 months ago
2010
Intersection cuts were introduced by Balas and the corner polyhedron by Gomory. Balas showed that intersection cuts are valid for the corner polyhedron. In this paper we show that...
ORL
2010
13 years 4 months ago
2010
We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these ...
ORL
2010
13 years 1 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...
ORL
2010
13 years 1 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...
ORL
2010
13 years 4 months ago
2010
Interval-gradient cuts are (nonlinear) valid inequalities for nonconvex NLPs defined for constraints g(x) ≤ 0 with g being continuously differentiable in a box [x, ¯x]. In th...