An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
From MaRDI portal
Publication:545555
DOI10.1007/S10479-010-0798-7zbMATH Open1214.90092OpenAlexW2093708362MaRDI QIDQ545555FDOQ545555
Luc Mercier, Pascal Van Hentenryck
Publication date: 22 June 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0798-7
Recommendations
- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
- Gap Reduction Techniques for Online Stochastic Project Scheduling
- Online stochastic optimization under time constraints
- Online stochastic reservation systems
- Anticipatory optimization for dynamic decision making
Cites Work
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Scenarios for multistage stochastic programs
- A class of stochastic programs with decision dependent uncertainty
- On complexity of multistage stochastic programs
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- LAO*: A heuristic search algorithm that finds solutions with loops
- A sparse sampling algorithm for near-optimal planning in large Markov decision processes
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Title not available (Why is that?)
- Sequential importance sampling algorithms for dynamic stochastic programming
- Online scheduling on multiple resources under stochastic conditions
- Gap Reduction Techniques for Online Stochastic Project Scheduling
Cited In (7)
- Embedding evolutionary strategy in ordinal optimization for hard optimization problems
- Valuing portfolios of interdependent real options under exogenous and endogenous uncertainties
- A node formulation for multistage stochastic programs with endogenous uncertainty
- Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
- Online spatio-temporal matching in stochastic and dynamic domains
- Hybrid metaheuristics for stochastic constraint programming
- OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
This page was built for publication: An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545555)
