Stochastic optimization is (almost) as easy as deterministic optimization. Shmoys, D. B & Swamy, C. In 45th Annual IEEE Symposium on Foundations of Computer Science, 2004. Proceedings, pages 228-- 237, 2004.
	title = {Stochastic optimization is (almost) as easy as deterministic optimization},
	booktitle = {45th {Annual} {IEEE} {Symposium} on {Foundations} of {Computer} {Science}, 2004. {Proceedings}},
	author = {Shmoys, D. B and Swamy, C.},
	year = {2004},
	keywords = {2-stage discrete stochastic optimization, 2-stage models, Constraint optimization, Cost function, Design optimization, FPRAS, Instruments, LP relaxation, Logistics, Transportation, Uncertainty, Vertex cover, approximation algorithms, deterministic optimization, distributional information, facility location, multicommodity flow problem, multicut, optimisation, probability distribution, random data, set cover, statistical distributions, stochastic processes, uncertainty modeling, well-studied paradigm},
	pages = {228-- 237}

Downloads: 0