Pages that link to "Item:Q2770073"
From MaRDI portal
The following pages link to The Dynamic and Stochastic Knapsack Problem (Q2770073):
Displayed 45 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- An adaptive stochastic knapsack problem (Q297367) (← links)
- Lending decisions with limits on capital available: the polygamous marriage problem (Q320958) (← links)
- Online network design with outliers (Q334928) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- Sequential stochastic assignment under uncertainty: estimation and convergence (Q453780) (← links)
- Improving LTL truck load utilization on line (Q531465) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- A single-resource allocation problem with Poisson resource requirements (Q732784) (← links)
- O\&D revenue management in cargo airlines-a mathematical programming approach (Q858605) (← links)
- Revenue management in make-to-order manufacturing-an application to the iron and steel industry (Q858612) (← links)
- Semi-Markov information model for revenue management and dynamic pricing (Q858615) (← links)
- Confidence-based reasoning in stochastic constraint programming (Q896433) (← links)
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
- An optimization model of the single-leg air cargo space control based on Markov decision process (Q1952795) (← links)
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues (Q1991289) (← links)
- Dynamic capacity allocation for group bookings in live entertainment (Q2023985) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- Meso-parametric value function approximation for dynamic customer acceptances in delivery routing (Q2183325) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering (Q2483486) (← links)
- A continuous-time seat control model for single-leg flights with no-shows and optimal overbooking upper bound (Q2503095) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem (Q3184585) (← links)
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract) (Q3439578) (← links)
- Managing Underperformance Risk in Project Portfolio Selection (Q3450467) (← links)
- An overview of revenue management and dynamic pricing models in hotel business (Q4579886) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- THE SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM WITH POSTPONEMENT OPTIONS (Q4929135) (← links)
- (Q4945108) (← links)
- Stochastic Knapsack Revisited: The Service Level Perspective (Q5080638) (← links)
- Uniformly Bounded Regret in the Multisecretary Problem (Q5113899) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- (Q5129172) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
- A deep real options policy for sequential service region design and timing (Q6065667) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)