An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization

DOI10.1007/s10479-010-0798-7zbMath1214.90092OpenAlexW2093708362MaRDI QIDQ545555

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

zbMATH Keywords

stochastic optimizationschedulingendogenous uncertainty

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items

Online spatio-temporal matching in stochastic and dynamic domains, Valuing portfolios of interdependent real options under exogenous and endogenous uncertainties, Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach, OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success, Embedding evolutionary strategy in ordinal optimization for hard optimization problems, A node formulation for multistage stochastic programs with endogenous uncertainty, Hybrid metaheuristics for stochastic constraint programming

Cites Work

• Unnamed Item
• Unnamed Item
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• A class of stochastic programs with decision dependent uncertainty
• Sequential importance sampling algorithms for dynamic stochastic programming
• On complexity of multistage stochastic programs
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Gap Reduction Techniques for Online Stochastic Project Scheduling
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Scenarios for multistage stochastic programs
• LAO*: A heuristic search algorithm that finds solutions with loops