On the Complexity of Unique Games and Graph Expansion
1 The Algorithm of Goemans and Williamson
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming
Integer Programs and Network Models
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
SDP gaps and UGC-hardness for Max-Cut-Gain
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
with an integrality gap of almost 2 | Coursera
Integer Programs and Network Models
arXiv:1801.07937v3 [cs.DM] 12 Jan 2019
Integrality Gaps for Sherali–Adams Relaxations
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
CS261 Lecture14: Algorithms in Bipartite Graphs | in theory
A Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
A Randomized Rounding Approach to the Traveling Salesman Problem
18.1 Graph Partitioning Problems
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
