The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
Lovász-Schrijver Reformulation
Integrality Gaps for Sherali–Adams Relaxations
Lecture 4b 1 MAX-CUT
1 The Algorithm of Goemans and Williamson
Convex Relaxations and Integrality Gaps
CS261 Lecture14: Algorithms in Bipartite Graphs | in theory
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
Integer Programs and Network Models
A Randomized Rounding Approach to the Traveling Salesman Problem
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
MINIMUM COST FLOWS: BASIC ALGORITHMS
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
On the Unique Games Conjecture
Untitled
with an integrality gap of almost 2 | Coursera
PDF) On the Configuration-LP for Scheduling on Unrelated Machines
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
