Randomized strategies for cardinality robustness in the knapsack problem (Q1675929): 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: W2293386763 / 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: Packing a Knapsack of Unknown Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Matchings and Matroid Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Matchings / 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: Randomized Strategies for Cardinality Robustness in the Knapsack Problem / 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: Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust randomized matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy in Approximation Algorithms / rank
 
Normal rank

Latest revision as of 15:41, 14 July 2024

scientific article
Language Label Description Also known as
English
Randomized strategies for cardinality robustness in the knapsack problem
scientific article

    Statements

    Identifiers