Article (2004)
Document published while its authors were not affiliated with Polytechnique Montréal
An external link is available for this item
| PolyPublie URL: | https://publications.polymtl.ca/38297/ |
|---|---|
| Journal Title: | Mathematical Methods of Operations Research (vol. 60, no. 3) |
| Publisher: | Springer |
| DOI: | 10.1007/s001860400377 |
| Official URL: | https://doi.org/10.1007/s001860400377 |
| Date Deposited: | 18 Apr 2023 15:19 |
| Last Modified: | 25 Sep 2024 16:22 |
| Cite in APA 7: | Anjos, M. F. (2004). On semidefinite programming relaxations for the satisfiability problem. Mathematical Methods of Operations Research, 60(3), 349-367. https://doi.org/10.1007/s001860400377 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
