Preface |
Introduction / 1: |
From A Priori to Online Stochastic Optimization / 1.1: |
Online Stochastic Combinatorial Optimization / 1.2: |
Online Anticipatory Algorithms / 1.3: |
Online Stochastic Combinatorial Optimization in Context / 1.4: |
Organization and Themes / 1.5: |
Online Stochastic Scheduling / I: |
The Generic Offline Problem / 2: |
The Online Problem / 2.2: |
The Generic Online Algorithm / 2.3: |
Properties of Online Stochastic Scheduling / 2.4: |
Oblivious Algorithms / 2.5: |
The Expectation Algorithm / 2.6: |
The Consensus Algorithm / 2.7: |
The Regret Algorithm / 2.8: |
Immediate Decision Making / 2.9: |
The Suboptimality Approximation Problem / 2.10: |
Notes and Further Reading / 2.11: |
Theoretical Analysis / 3: |
Expected Loss / 3.1: |
Local Errors / 3.2: |
Bounding Local Errors / 3.3: |
The Theoretical Results / 3.4: |
Discussion on the Theoretical Assumptions / 3.5: |
Packet Scheduling / 3.6: |
The Packet Scheduling Problem / 4.1: |
The Optimization Algorithm / 4.2: |
The Greedy Algorithm is Competitive / 4.3: |
The Suboptimality Approximation / 4.4: |
Experimental Setting / 4.5: |
Experimental Results / 4.6: |
The Anticipativity Assumption / 4.7: |
Online Stochastic Reservations / 4.8: |
The Offline Reservation Problem / 5: |
Cancellations / 5.2: |
Online Multiknapsack Problems / 6: |
Online Multiknapsack with Deadlines / 6.1: |
Online Stochastic Routing / 6.2: |
Vehicle Routing with Time Windows / 7: |
Vehicle Dispatching and Routing / 7.1: |
Large Neighborhood Search / 7.2: |
Online Stochastic Vehicle Routing / 7.3: |
Online Single Vehicle Routing / 8.2: |
Service Guarantees / 8.3: |
A Waiting Strategy / 8.4: |
A Relocation Strategy / 8.5: |
Multiple Pointwise Decisions / 8.6: |
Online Vehicle Dispatching / 8.7: |
The Online Vehicle Dispatching Problems / 9.1: |
Setting of the Algorithms / 9.2: |
Visualizations of the Algorithms / 9.3: |
Online Vehicle Routing with Time Windows / 9.5: |
The Online Instances / 10.1: |
Learning and Historical Sampling / 10.2: |
Learning Distributions / 11: |
The Learning Framework / 11.1: |
Hidden Markov Models / 11.2: |
Learning Hidden Markov Models / 11.3: |
Historical Sampling / 11.4: |
Historical Averaging / 12.1: |
Sequential Decision Making / 12.2: |
Markov Chance-Decision Processes / 13: |
Motivation / 13.1: |
Decision-Chance versus Chance-Decision / 13.2: |
Equivalence of MDCPs and MCDPs / 13.3: |
The Approximation Theorem for Anticipative MCDPs / 13.4: |
Beyond Anticipativity / 13.6: |
The General Approximation Theorem for MCDPs / 13.8: |
References / 13.9: |
Index |
Preface |
Introduction / 1: |
From A Priori to Online Stochastic Optimization / 1.1: |
Online Stochastic Combinatorial Optimization / 1.2: |
Online Anticipatory Algorithms / 1.3: |
Online Stochastic Combinatorial Optimization in Context / 1.4: |