Online Stochastic Combinatorial Optimization (Mit Press)
Hentenryck, Pascal Van
Sold by Toscana Books, AUSTIN, TX, U.S.A.
AbeBooks Seller since November 7, 2023
New - Soft cover
Condition: New
Quantity: 1 available
Add to basketSold by Toscana Books, AUSTIN, TX, U.S.A.
AbeBooks Seller since November 7, 2023
Condition: New
Quantity: 1 available
Add to basketExcellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.
Seller Inventory # Scanned0262513471
A framework for online decision making under uncertainty and time constraints, with online stochastic algorithms for implementing the framework, performance guarantees, and demonstrations of a variety of applications.
Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge. This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.
"About this title" may belong to another edition of this title.
All returns are accepted within 30 days.
All books will be shipped through media mail. All books will be shipped within 2 business days.
| Order quantity | 14 to 21 business days | 13 to 14 business days | 
|---|---|---|
| First item | US$ 4.30 | US$ 14.50 | 
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.




