Paper (2003)
Document published while its authors were not affiliated with Polytechnique Montréal
An external link is available for this item
| ISBN: | 9783642170225 |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/38298/ |
| Conference Title: | International Conference on Operations Research (OR 2003) |
| Conference Location: | Berlin, Heidelberg |
| Conference Date(s): | 2003-09-03 - 2003-09-05 |
| Publisher: | Springer |
| DOI: | 10.1007/978-3-642-17022-5_40 |
| Official URL: | https://doi.org/10.1007/978-3-642-17022-5_40 |
| Date Deposited: | 18 Apr 2023 15:19 |
| Last Modified: | 25 Sep 2024 16:22 |
| Cite in APA 7: | Anjos, M. F. (2003, September). Proofs of Unsatisfiability Via Semidefinite Programming [Paper]. International Conference on Operations Research (OR 2003), Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17022-5_40 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
