Computing knapsack solutions with cardinality robustness (Q1926647): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Matchings and Matroid Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Knapsack Solutions with Cardinality Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approach for Incremental Approximation and Hierarchical Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Independence Functions / rank
 
Normal rank

Latest revision as of 00:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Computing knapsack solutions with cardinality robustness
scientific article

    Statements

    Computing knapsack solutions with cardinality robustness (English)
    0 references
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    knapsack problems
    0 references
    robustness
    0 references
    NP-hardness
    0 references
    FPTAS
    0 references

    Identifiers