OpenAlex
PricingAboutJobs
Log inGet started
Work

Approximation algorithms for knapsack problems with cardinality constraints

HTML

Year: 2000
Type: article
Source: European Journal of Operational Research
DOI: 10.1016/s0377-2217(99)00261-1
Authors: Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger
Institutions: University of Bologna, University of Graz, University of Copenhagen
Language: English

Topic: Optimization and Packing Problems
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
FWCI: 22.37
Cites: 25
Cited by: 211
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms