APA (7th ed.) Citation

Assumpção, H., & Coutinho, G. (2026). Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs. Mathematics of Operations Research (INFORMS), 1. https://doi.org/10.1287/moor.2025.1044

Chicago Style (17th ed.) Citation

Assumpção, Henrique, and Gabriel Coutinho. "Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs." Mathematics of Operations Research (INFORMS) 2026: 1. https://doi.org/10.1287/moor.2025.1044.

MLA (9th ed.) Citation

Assumpção, Henrique, and Gabriel Coutinho. "Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs." Mathematics of Operations Research (INFORMS), 2026, p. 1, https://doi.org/10.1287/moor.2025.1044.