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 |
The Bernstein Branch-and-Bound Unconstrained Global Optimization Algorithm for MINLP Problems
|
---|---|
Chapter number | 15 |
Book title |
Scientific Computing, Computer Arithmetic, and Validated Numerics
|
Published by |
Springer, Cham, September 2015
|
DOI | 10.1007/978-3-319-31769-4_15 |
Book ISBNs |
978-3-31-931768-7, 978-3-31-931769-4
|
Authors |
Bhagyesh V. Patil, P. S. V. Nataraj |
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 % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 50% |
Unspecified | 1 | 25% |
Other | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Unspecified | 1 | 25% |
Energy | 1 | 25% |
Engineering | 1 | 25% |
Unknown | 1 | 25% |