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 Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows
|
---|---|
Chapter number | 26 |
Book title |
Parallel Processing and Applied Mathematics
|
Published by |
Springer, Berlin, Heidelberg, September 2011
|
DOI | 10.1007/978-3-642-31464-3_26 |
Book ISBNs |
978-3-64-231463-6, 978-3-64-231464-3
|
Authors |
Mirosław Błocho, Zbigniew J. Czech |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Greece | 1 | 25% |
China | 1 | 25% |
Unknown | 2 | 50% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 75% |
Unknown | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Engineering | 2 | 50% |
Computer Science | 1 | 25% |
Unknown | 1 | 25% |