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 Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times
|
---|---|
Chapter number | 4 |
Book title |
Combinatorial Optimization
|
Published by |
Springer, Berlin, Heidelberg, January 1992
|
DOI | 10.1007/978-3-642-77489-8_4 |
Book ISBNs |
978-3-64-277491-1, 978-3-64-277489-8
|
Authors |
G. L. Nemhauser, M. W. P. Savelsbergh |
Mendeley readers
The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 17 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 35% |
Student > Doctoral Student | 3 | 18% |
Professor > Associate Professor | 2 | 12% |
Lecturer | 1 | 6% |
Student > Bachelor | 1 | 6% |
Other | 3 | 18% |
Unknown | 1 | 6% |
Readers by discipline | Count | As % |
---|---|---|
Business, Management and Accounting | 4 | 24% |
Engineering | 3 | 18% |
Computer Science | 3 | 18% |
Mathematics | 2 | 12% |
Unspecified | 1 | 6% |
Other | 2 | 12% |
Unknown | 2 | 12% |