You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
A minimal algorithm for the Bounded Knapsack Problem
|
---|---|
Chapter number | 44 |
Book title |
Integer Programming and Combinatorial Optimization
|
Published by |
Springer, Berlin, Heidelberg, May 1995
|
DOI | 10.1007/3-540-59408-6_44 |
Book ISBNs |
978-3-54-059408-6, 978-3-54-049245-0
|
Authors |
David Pisinger |
Mendeley readers
The data shown below were compiled from readership statistics for 19 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Portugal | 1 | 5% |
Hong Kong | 1 | 5% |
Brazil | 1 | 5% |
India | 1 | 5% |
United States | 1 | 5% |
Unknown | 14 | 74% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 32% |
Professor > Associate Professor | 4 | 21% |
Professor | 3 | 16% |
Researcher | 3 | 16% |
Student > Doctoral Student | 1 | 5% |
Other | 1 | 5% |
Unknown | 1 | 5% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 37% |
Business, Management and Accounting | 5 | 26% |
Engineering | 4 | 21% |
Decision Sciences | 1 | 5% |
Mathematics | 1 | 5% |
Other | 0 | 0% |
Unknown | 1 | 5% |