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.
| Chapter title |
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
|
|---|---|
| Chapter number | 31 |
| Book title |
Principles and Practice of Constraint Programming - CP 2005
|
| Published by |
Springer, Berlin, Heidelberg, October 2005
|
| DOI | 10.1007/11564751_31 |
| Book ISBNs |
978-3-54-029238-8, 978-3-54-032050-0
|
| Authors |
Chu Min Li, Felip Manyà, Jordi Planes, Li, Chu Min, Manyà, Felip, Planes, Jordi |
Mendeley readers
The data shown below were compiled from readership statistics for 15 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Japan | 1 | 7% |
| Unknown | 14 | 93% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Researcher | 3 | 20% |
| Student > Master | 2 | 13% |
| Student > Ph. D. Student | 2 | 13% |
| Other | 1 | 7% |
| Student > Doctoral Student | 1 | 7% |
| Other | 2 | 13% |
| Unknown | 4 | 27% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 11 | 73% |
| Unknown | 4 | 27% |