Complexity results and exact algorithms for robust knapsack problems (Q2247901): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988397112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the max-min 0-1 knapsack problem / 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 Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem / 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: Min-max regret robust optimization approach on interval data uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the continuous unbounded knapsack problem with uncertain coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results and exact algorithms for robust knapsack problems / 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: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minmax multidimensional knapsack problem with application to a chance‐constrained problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lexicographic α-robust knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data / rank
 
Normal rank

Latest revision as of 17:25, 8 July 2024

scientific article
Language Label Description Also known as
English
Complexity results and exact algorithms for robust knapsack problems
scientific article

    Statements

    Complexity results and exact algorithms for robust knapsack problems (English)
    0 references
    0 references
    0 references
    30 June 2014
    0 references
    knapsack problem
    0 references
    robustness
    0 references
    scenario-relaxation algorithm
    0 references
    NP-hardness
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references

    Identifiers