Sciweavers

55 search results - page 9 / 11
» orl 2008
Sort
View
ORL
2008
124views more  ORL 2008»
14 years 11 months ago
Sample average approximation of expected value constrained stochastic programs
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
Wei Wang, Shabbir Ahmed
ORL
2008
111views more  ORL 2008»
14 years 11 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
ORL
2008
86views more  ORL 2008»
14 years 11 months ago
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...
Eissa Nematollahi, Tamás Terlaky
ORL
2008
99views more  ORL 2008»
14 years 11 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ORL
2008
77views more  ORL 2008»
14 years 11 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...