Towards stochastic constraint programming: A study of online multi-choice knapsack with deadlines
From MaRDI portal
Recommendations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- Online stochastic reservation systems
- Online stochastic optimization under time constraints
Cited in
(11)- Filtering algorithms for global chance constraints
- Online stochastic optimization under time constraints
- Hybrid metaheuristics for stochastic constraint programming
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Modeling recreational systems using optimization techniques and information technologies
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
- Solving the online on-demand warehousing problem
- Introducing statistical consistency for infinite chance constraints
- Online stochastic reservation systems
- Confidence-based reasoning in stochastic constraint programming
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
This page was built for publication: Towards stochastic constraint programming: A study of online multi-choice knapsack with deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475621)