Approximation algorithms for knapsack problems with cardinality constraints
Year: 2000
Type: article
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: knapsack problem, cardinality constraints, approximation algorithms, polynomial-time approximation scheme, fully polynomial time approximation scheme, cutting stock problem, column generation, cover inequalities, cutting plane method, integer linear programming, subset sums, dynamic programming
Open Access status: closed
OpenAlex ID: W2031666601
