ORL 2006 - PDF Preprint Papers

ORL 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ORL-2006 Paper

click to vote

ORL
2006

118views more ORL 2006»

On complexity of multistage stochastic programs

13 years 11 months ago

Download www.optimization-online.org

In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...

Alexander Shapiro

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	118	On complexity of multistage stochastic programs	claim
2	116	Greedy multiprocessor server scheduling	claim
3	114	A (1-1/e)-approximation algorithm for the generalized assignment problem	claim
4	105	Inventory placement in acyclic supply chain networks	claim
5	103	Reduction tests for the prize-collecting Steiner problem	claim
6	98	The communication complexity of private value single-item auctions	claim
7	92	The k-level facility location game	claim
8	91	Resource augmentation in two-dimensional packing with orthogonal rotations	claim
9	87	SPAR: stochastic programming with adversarial recourse	claim
10	85	A simple proof of diffusion approximations for LBFS re-entrant lines	claim
11	84	An M/M/1 retrial queue with unreliable server	claim
12	73	Coordination through De Bruijn sequences	claim
13	72	A note on two-person zero-sum communicating stochastic games	claim
14	67	Approximation algorithms for dynamic resource allocation	claim
15	65	Solving asymmetric variational inequalities via convex optimization	claim
16	64	Optimal prices for finite capacity queueing systems	claim
17	60	Finding the K shortest hyperpaths using reoptimization	claim
18	55	MIPLIB 2003	claim
19	55	Who should be given priority in a queue?	claim
20	54	A workload-dependent M/G/1 queue under a two-stage service policy	claim
21	45	Source location with rigidity and tree packing requirements	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers