Sciweavers

ORL
2007
61views more  ORL 2007»
13 years 11 months ago
Exact solutions to linear programming problems
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutio...
David Applegate, William J. Cook, Sanjeeb Dash, Da...
ORL
2007
112views more  ORL 2007»
13 years 11 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...
ORL
2007
50views more  ORL 2007»
13 years 11 months ago
NP-Hardness of checking the unichain condition in average cost MDPs
The unichain condition requires that every policy in an MDP result in a single ergodic class, and guarantees that the optimal average cost is independent of the initial state. We ...
John N. Tsitsiklis
ORL
2007
81views more  ORL 2007»
13 years 11 months ago
An improved probability bound for the Approximate S-Lemma
The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism resu...
Kürsad Derinkuyu, Mustafa Ç. Pinar, Ah...
ORL
2007
51views more  ORL 2007»
13 years 11 months ago
An exact algorithm for MAX-CUT in sparse graphs
Federico Della Croce, M. J. Kaminski, Vangelis Th....
ORL
2007
49views more  ORL 2007»
13 years 11 months ago
Lot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one ...
Hamish Waterer
ORL
2007
72views more  ORL 2007»
13 years 11 months ago
Colorings of k-balanced matrices and integer decomposition property of related polyhedra
We show that a class of polyhedra, arising from certain 0, 1 matrices introduced by Truemper and Chandrasekaran, has the integer decomposition property. This is accomplished by pr...
Giacomo Zambelli
ORL
2007
66views more  ORL 2007»
13 years 11 months ago
On polling systems with large setups
Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling syst...
Erik M. M. Winands
ORL
2007
80views more  ORL 2007»
13 years 11 months ago
Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
For the M/D/1 processor sharing queue, explicit formulas for the coefficient of variation of the sojourn time conditioned on the service time and on the residual service times of ...
Michael Shalmon