Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-009-0577-5 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-009-0577-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058409291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Secretary Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / 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: A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem / 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: The Minimization of Semicontinuous Functions: Mollifier Subgradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Estimation of the Maximum of a Regression Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527034 / 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: The Sample Average Approximation Method for Stochastic Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust approach to the chance-constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budget-Dependent Convergence Rate of Stochastic Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Value Functions of Stochastic Knapsack Problems: A Homogeneous Monge-Amp\'ere Equation and Its Stochastic Counterparts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic on-line knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New method of stochastic approximation type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Approximation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for 0-1 polynomial Knapsack problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-009-0577-5 / rank
 
Normal rank

Latest revision as of 11:37, 10 December 2024

scientific article
Language Label Description Also known as
English
Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
scientific article

    Statements

    Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (English)
    0 references
    0 references
    0 references
    20 September 2010
    0 references
    static stochastic Knapsack problems with random weights
    0 references
    simple recourse
    0 references
    chance constrained
    0 references
    expectation constrained
    0 references
    stochastic gradient algorithm
    0 references
    arrow-hurwicz
    0 references
    SOCP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers