Randomized strategies for cardinality robustness in the knapsack problem
type: Item
instance of: scholarly article
title: Randomized strategies for cardinality robustness in the knapsack problem
zbMATH Open document ID: 1380.90237
author: Yusuke Kobayashi
author: Kenjiro Takazawa
published in: Theoretical Computer Science
publication date: 2017-11-03T00:00:00Z
full work available at URL: https://tsukuba.repo.nii.ac.jp/
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6802754
zbMATH Keywords: robust independence system
zbMATH Keywords: randomized strategy
zbMATH Keywords: knapsack problem
zbMATH Keywords: exchangeability
describes a project that uses: Knapsack
MaRDI profile type: Publication
OpenAlex ID: W2293386763
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Packing a Knapsack of Unknown Capacity
cites work: Robust matchings and matroid intersections
cites work: Robust Matchings
cites work: Q4119222
cites work: Robust independence systems
cites work: Computing knapsack solutions with cardinality robustness
cites work: Randomized Strategies for Cardinality Robustness in the Knapsack Problem
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
cites work: Robust randomized matchings
cites work: Greedy in Approximation Algorithms
DOI: 10.1016/J.TCS.2016.12.019
description: scientific article; zbMATH DE number 6802754