Sciweavers

ORL
2010
112views more  ORL 2010»
12 years 11 months ago
Beneficial changes in dependence structures and two-moment decision models
: We analyze the comparative static effects of beneficial changes in the dependence structure between risks. In an insurance model with an insurable loss and dependent background w...
Thomas Eichner, Andreas Wagener
ORL
2010
98views more  ORL 2010»
13 years 3 months ago
A facial reduction algorithm for finding sparse SOS representations
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for a...
Hayato Waki, Masakazu Muramatsu
ORL
2010
93views more  ORL 2010»
13 years 3 months ago
Internal vs. external risk measures: How capital requirements differ in practice
: We compare capital requirements derived by tail conditional expectation (TCE) with those derived by tail conditional median (TCM) and find that there is no clear-cut relationship...
Martin Eling, Luisa Tibiletti
ORL
2010
76views more  ORL 2010»
13 years 3 months ago
Small bipartite subgraph polytopes
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 ...
Laura Galli, Adam N. Letchford
ORL
2010
73views more  ORL 2010»
13 years 3 months ago
Sensitivity analysis of the Eisenberg-Noe model of contagion
We use linear programming to provide a sensitivity analysis of Eisenberg and Noe’s one-period model of contagion via direct bilateral links. We provide a formula for the sensiti...
Ming Liu, Jeremy Staum
ORL
2010
56views more  ORL 2010»
13 years 3 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
2010
59views more  ORL 2010»
13 years 3 months ago
Minimizing the sum of weighted completion times in a concurrent open shop
Monaldo Mastrolilli, Maurice Queyranne, Andreas S....
ORL
2010
85views more  ORL 2010»
13 years 3 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...