Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs.

Saved in:

Bibliographic Details
Title:	Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs.
Authors:	Assumpção, Henrique¹ (AUTHOR) henrique.soares@dcc.ufmg.br, Coutinho, Gabriel¹ (AUTHOR) gabriel@dcc.ufmg.br
Source:	Mathematics of Operations Research (INFORMS). Jun2026, p1. 12p.
Database:	Business Source Ultimate

Description
ISSN:	0364765X
DOI:	10.1287/moor.2025.1044