Lovász-Schrijver Reformulation
arXiv:1801.07937v3 [cs.DM] 12 Jan 2019
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
SDP gaps and UGC-hardness for Max-Cut-Gain
Integer Programs and Network Models
PDF) On the Configuration-LP for Scheduling on Unrelated Machines
On the Unique Games Conjecture
On the Complexity of Unique Games and Graph Expansion
Convex Relaxations and Integrality Gaps
Maximum cut - Wikipedia
with an integrality gap of almost 2 | Coursera
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
PDF) Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Approximation Algorithms CS599 Homework 3 Date: December 5, 2014 Due: December 12, 2014 1. Discrepancy. Consider a set system S
Integer Programs and Network Models
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming
A Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming Introduction
CS261 Lecture14: Algorithms in Bipartite Graphs | in theory
Untitled
CSCI 5654 Handout List Required reading is from Chvátal. Optional reading is from these reference books: A: AMPL K: Karloff M:
Lecture 4b 1 MAX-CUT
1 The Algorithm of Goemans and Williamson
