Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decomposition approaches for recoverable robust optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robust Knapsacks: Γ-Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust knapsacks: the discrete scenario case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness for Railway Rolling Stock Planning / 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: An adaptive stochastic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness in Shunting and Timetabling / 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 branch-and-bound algorithm for hard multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problem with probability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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 with Random Sized Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the two-stage stochastic knapsack problem with discretely distributed weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-stage stochastic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the 0/1 multi-knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the zero-one multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound and bound algorithm for the zero-one multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank

Latest revision as of 03:11, 16 July 2024

scientific article
Language Label Description Also known as
English
Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
scientific article

    Statements

    Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    two-stage stochastic programming
    0 references
    recoverable robustness
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    multiple knapsack problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers