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 |
Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
|
|---|---|
| Chapter number | 42 |
| Book title |
Algorithms and Computation
|
| Published by |
Springer, Berlin, Heidelberg, December 2015
|
| DOI | 10.1007/978-3-662-48971-0_42 |
| Book ISBNs |
978-3-66-248970-3, 978-3-66-248971-0
|
| Authors |
Andrew Mastin, Patrick Jaillet, Sang Chin |
Mendeley readers
The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Estonia | 1 | 8% |
| Unknown | 11 | 92% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 6 | 50% |
| Student > Master | 3 | 25% |
| Researcher | 2 | 17% |
| Unknown | 1 | 8% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 5 | 42% |
| Engineering | 3 | 25% |
| Decision Sciences | 1 | 8% |
| Business, Management and Accounting | 1 | 8% |
| Unknown | 2 | 17% |