A Randomized Rounding Approach to the Traveling Salesman Problem
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Optimization over Polynomials: Selected Topics
On the Unique Games Conjecture
Maximum cut - Wikipedia
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
A Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
with an integrality gap of almost 2 | Coursera
Untitled
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
Approximation Algorithms CS599 Homework 3 Date: December 5, 2014 Due: December 12, 2014 1. Discrepancy. Consider a set system S
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
SDP gaps and UGC-hardness for Max-Cut-Gain
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming Introduction
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
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Integrality Gaps for Sherali–Adams Relaxations
On the Complexity of Unique Games and Graph Expansion
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
Lovász-Schrijver Reformulation
MINIMUM COST FLOWS: BASIC ALGORITHMS
