Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs.
Saved in:
| Title: | Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs. |
|---|---|
| Authors: | Assumpção, Henrique1 (AUTHOR) henrique.soares@dcc.ufmg.br, Coutinho, Gabriel1 (AUTHOR) gabriel@dcc.ufmg.br |
| Source: | Mathematics of Operations Research (INFORMS). Jun2026, p1. 12p. |
| Database: | Business Source Ultimate |
Be the first to leave a comment!
