Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Price-Directed Approach to Stochastic Inventory/Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulations for 0-1 knapsack sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Relaxations and Duality in Stochastic Dynamic Programs / 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: The Linear Programming Approach to Approximate Dynamic Programming / 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: Q2921694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Renewal Decision Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4357206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the chance-constrained knapsack problem with random item sizes / 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: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocating Bandwidth for Bursty Connections / 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: Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / 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: Stochastic linear knapsack programming problem and its application to a portfolio selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / 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: A note on the extension complexity of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polynomial approximations in Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preference Order Stochastic Knapsack Problems: Methodological Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Traveling Salesman Problem with Stochastic Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPLINE APPROXIMATIONS TO VALUE FUNCTIONS / rank
 
Normal rank

Revision as of 13:00, 12 July 2024

scientific article
Language Label Description Also known as
English
Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
scientific article

    Statements

    Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    stochastic knapsack
    0 references
    relaxation
    0 references
    dynamic program
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references