Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Uniformly Bounded Regret in the Multisecretary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online selection of a monotone subsequence: a central limit theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive <i>O</i>(log <i>n</i>)‐optimal policy for the online selection of a monotone subsequence from a random sample / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations to Stochastic Dynamic Programs via Information Relaxation Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-fit selection of random sizes under a sum constraint: weak convergence and moment comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-solving stochastic programming models for airline revenue management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal selection of stochastic intervals under a sum constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Behavior of an Allocation Policy for Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Sequential Allocation Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Renewal Decision Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem with Random Sized Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic combinatorial optimization via poisson approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic on-line knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The static stochastic knapsack problem with normally distributed item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3242346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequential Investment Decisions Under Conditions of Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of random variables under a sum constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal sequential selection of a monotone sequence from a random sample / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bruss-Robertson Inequality:Elaborations, Extensions, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and practice of revenue management / rank
 
Normal rank

Revision as of 10:21, 23 July 2024

scientific article; zbMATH DE number 7243697
Language Label Description Also known as
English
Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards
scientific article; zbMATH DE number 7243697

    Statements

    Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (English)
    0 references
    0 references
    0 references
    4 September 2020
    0 references
    dynamic and stochastic knapsack problem
    0 references
    regret
    0 references
    reoptimization
    0 references
    adaptive online policy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references