OpenAlex
PricingAboutJobs
Log inGet started
Work

Introduction to NP-Completeness of Knapsack Problems

HTML

Year: 2004
Type: book-chapter
Source: Springer eBooks
Parent work: Knapsack Problems
DOI: 10.1007/978-3-540-24777-7_16
Authors: Hans Kellerer, Ulrich Pferschy, David Pisinger
Institutions: 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, NP-completeness, polynomial-time algorithms, computational complexity, combinatorial optimization, exponential-time algorithms, optimality

Open Access status: closed
OpenAlex ID: W11724259
FWCI:
Cites:
Cited by: 216
Related to: 9
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security