On different approximation criteria for subset product problems

DOI10.1016/0020-0190(85)90061-4zbMath0593.90056OpenAlexW1977674079MaRDI QIDQ1076608

B. George

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90061-4

zbMATH Keywords

dominance ruleapproximation criterianecessary and sufficient condition for the approximabilityproduct objective function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (4)

Approximate solution of NP optimization problems ⋮ ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toward a unified approach for the classification of NP-complete optimization problems
• Non deterministic polynomial optimization problems and their approximations
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem

This page was built for publication: On different approximation criteria for subset product problems