OpenAlex
PricingAboutJobs
Log inGet started
Work

An Efficient Algorithm for the Knapsack Sharing Problem

HTML

Year: 2002
Type: article
Source: Computational Optimization and Applications
DOI: 10.1023/a:1019920507008
Authors: Mhand Hifi, Slim Sadfi, Abdelkader Sbihi
Institutions: Université de Picardie Jules Verne, Centre National de la Recherche Scientifique, Université Paris 1 Panthéon-Sorbonne
Language: English

Topic: Optimization and Packing Problems
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: combinatorial optimization, tabu search, local search, NP-hard problems, approximate algorithms

Open Access status: green
OpenAlex ID: W2150560290
FWCI: 3.096
Cites: 20
Cited by: 19
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