Online stochastic optimization under time constraints
From MaRDI portal
Recommendations
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- scientific article; zbMATH DE number 1688603
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cites work
- A simulation-based approach to two-stage stochastic programming with recourse
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Adversarial queuing theory
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Approximation in stochastic scheduling
- Beyond Competitive Analysis
- Buffer Overflow Management in QoS Switches
- Competitive snoopy caching
- Continuity Properties of Expectation Functions in Stochastic Integer Programming
- scientific article; zbMATH DE number 3513051 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1175949 (Why is no real title available?)
- scientific article; zbMATH DE number 2084697 (Why is no real title available?)
- Introduction to Stochastic Programming
- On structure and stability in stochastic programs with random technology matrix and complete integer recourse
- On the random 2-stage minimum spanning tree
- On the sum-of-squares algorithm for bin packing
- Online algorithms. The state of the art
- Partially dynamic vehicle routing—models and algorithms
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
- Stability of Solutions for Stochastic Programs with Complete Recourse
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Stochastic Machine Scheduling with Precedence Constraints
- Stochastic scheduling problems I — General strategies
- Sub-optimality Approximations
- The value function of a mixed integer program. II
- Two‐stage stochastic integer programming: a survey
Cited in
(22)- OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
- Modelling the mobile target covering problem using flying drones
- scientific article; zbMATH DE number 1688603 (Why is no real title available?)
- Online Optimization with Uncertain Information
- The post-disaster debris clearance problem under incomplete information
- Heuristics for dynamic and stochastic routing in industrial shipping
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- scientific article; zbMATH DE number 2084697 (Why is no real title available?)
- Constrained Online Convex Optimization With Feedback Delays
- scientific article; zbMATH DE number 7626738 (Why is no real title available?)
- Integrated offline and online decision making under uncertainty
- Gap Reduction Techniques for Online Stochastic Project Scheduling
- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Time-Variation in Online Nonconvex Optimization Enables Escaping From Spurious Local Minima
- Divide and conquer: a granular concept-cognitive computing system for dynamic classification decision making
- Nonlinear optimization filters for stochastic time-varying convex optimization
- Data-driven customer acceptance for attended home delivery
- Online optimization: probabilistic analysis and algorithm engineering
- Solving the online on-demand warehousing problem
This page was built for publication: Online stochastic optimization under time constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1958625)
