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 |
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
|
|---|---|
| Chapter number | 5 |
| Book title |
Computational Combinatorial Optimization
|
| Published by |
Springer Berlin Heidelberg, January 2001
|
| DOI | 10.1007/3-540-45586-8_5 |
| Book ISBNs |
978-3-54-042877-0, 978-3-54-045586-8
|
| Authors |
Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi |
| Editors |
Michael Jünger, Denis Naddef |
Mendeley readers
The data shown below were compiled from readership statistics for 21 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 21 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 4 | 19% |
| Researcher | 4 | 19% |
| Student > Master | 4 | 19% |
| Student > Bachelor | 2 | 10% |
| Other | 1 | 5% |
| Other | 2 | 10% |
| Unknown | 4 | 19% |
| Readers by discipline | Count | As % |
|---|---|---|
| Business, Management and Accounting | 4 | 19% |
| Mathematics | 3 | 14% |
| Engineering | 3 | 14% |
| Chemical Engineering | 2 | 10% |
| Computer Science | 2 | 10% |
| Other | 3 | 14% |
| Unknown | 4 | 19% |