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 |
On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
|
---|---|
Chapter number | 54 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, August 2006
|
DOI | 10.1007/11809678_54 |
Book ISBNs |
978-3-54-036925-7, 978-3-54-036926-4
|
Authors |
Dae-Sik Choi, In-Chan Choi, Choi, Dae-Sik, Choi, In-Chan |
Mendeley readers
The data shown below were compiled from readership statistics for 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 8 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 3 | 38% |
Student > Ph. D. Student | 3 | 38% |
Professor | 1 | 13% |
Unknown | 1 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 63% |
Neuroscience | 1 | 13% |
Engineering | 1 | 13% |
Unknown | 1 | 13% |