98 search results - page 7 / 20 » orl 2006 |
ORL
1998
14 years 10 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
ORL
2002
14 years 10 months ago
2002
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for...
ORL
2007
14 years 10 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
ORL
2007
14 years 10 months ago
2007
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
ORL
2007
14 years 10 months ago
2007
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...