OpenAlex
PricingAboutJobs
Log inGet started
Work

Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

HTML

Year: 2000
Type: article
Source: Journal of Combinatorial Optimization
DOI: 10.1023/a:1009894503716
Authors: M. Dawande, J. Kalagnanam, P. Keskinocak, F.S. Salman, R. Ravi
Institutions: IBM (United States), IBM Research - Thomas J. Watson Research Center, Georgia Institute of Technology, Carnegie Mellon University
Language: English

Topic: Optimization and Packing Problems
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: multiple knapsack problem, approximation algorithms, greedy algorithm, bicriteria approximation, bin packing

Open Access status: closed
OpenAlex ID: W1480006018
FWCI: 8.795
Cites: 23
Cited by: 165
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security