On different approximation criteria for subset product problems
type: Item
instance of: scholarly article
title: On different approximation criteria for subset product problems
zbMATH Open document ID: 0593.90056
DOI: 10.1016/0020-0190(85)90061-4
author: B. George
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3954651
zbMATH Keywords: approximation criteria
zbMATH Keywords: product objective function
zbMATH Keywords: dominance rule
zbMATH Keywords: necessary and sufficient condition for the approximability
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90061-4
OpenAlex ID: W1977674079
cites work: Toward a unified approach for the classification of NP-complete optimization problems
cites work: Q3923601
cites work: Q4198056
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q3912008
cites work: Non deterministic polynomial optimization problems and their approximations
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
description: scientific article; zbMATH DE number 3954651