Sciweavers

AOR
2010
13 years 9 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
AOR
2010
13 years 9 months ago
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
Javier Peña, Xavier Saynac, Juan Carlos Ver...
AOR
2010
13 years 9 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
AOR
2010
13 years 9 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi