View Item 

Show simple item record

Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
dc.contributor.authorSinha, Amitabhen_US
dc.contributor.authorRavi, R.en_US
dc.date.accessioned2006-09-11T16:34:07Z
dc.date.available2006-09-11T16:34:07Z
dc.date.issued2005-12-30en_US
dc.identifier.citationRavi, R.; Sinha, Amitabh; (2005). "Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems." Mathematical Programming (): -. <http://hdl.handle.net/2027.42/45871>en_US
dc.identifier.issn0025-5610en_US
dc.identifier.issn1436-4646en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/45871
dc.description.abstractWe study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our problems range from the graph-theoretic (shortest path, vertex cover, facility location) to set-theoretic (set cover, bin packing), and contain representatives with different approximation ratios.en_US
dc.format.extent201436 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; Springer-Verlag Berlin Heidelbergen_US
dc.subject.other20C20en_US
dc.subject.other20E28en_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherNumerical Analysisen_US
dc.subject.otherMathematicsen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherOptimizationen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.subject.other20G40en_US
dc.titleHedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problemsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumRoss School of Business, , University of Michigan, , Ann Arbor, MI, 48109, USAen_US
dc.contributor.affiliationotherTepper School of Business, , Carnegie Mellon University, , Pittsburgh, PA, 15213, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/45871/1/10107_2005_Article_673.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/s10107-005-0673-5en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10107_2005_Article_673.pdf
Size:
196.7KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.