Computing knapsack solutions with cardinality robustness
type: Item
instance of: scholarly article
title: Computing knapsack solutions with cardinality robustness
zbMATH Open document ID: 1258.68184
author: Naonori Kakimura
author: Kazuhisa Makino
author: Kento Seimi
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6119218
zbMATH Keywords: knapsack problems
zbMATH Keywords: robustness
zbMATH Keywords: NP-hardness
zbMATH Keywords: FPTAS
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s13160-012-0075-z
OpenAlex ID: W1994753237
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Q3182207
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Matroids and the greedy algorithm
cites work: Robust Matchings and Matroid Intersections
cites work: Q3579461
cites work: Q4198056
cites work: Robust Matchings
cites work: Algorithm Theory - SWAT 2004
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4119222
cites work: Robust Independence Systems
cites work: Computing Knapsack Solutions with Cardinality Robustness
cites work: A new fully polynomial time approximation scheme for the Knapsack problem
cites work: Q4821303
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: Robust discrete optimization and its applications
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: A General Approach for Incremental Approximation and Hierarchical Clustering
cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem
cites work: The Online Median Problem
cites work: Q4247440
cites work: Note on Independence Functions
DOI: 10.1007/S13160-012-0075-Z
description: scientific article; zbMATH DE number 6119218