Sciweavers

98 search results - page 16 / 20
» orl 2006
Sort
View
ORL
2007
66views more  ORL 2007»
14 years 10 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
112views more  ORL 2007»
14 years 10 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
61views more  ORL 2007»
14 years 10 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
2010
56views more  ORL 2010»
14 years 8 months ago
On interval-subgradient and no-good cuts
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...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
ORL
1998
136views more  ORL 1998»
14 years 10 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...