Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Integrality Gaps for Sherali–Adams Relaxations
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Integer Programs and Network Models
CSCI 5654 Handout List Required reading is from Chvátal. Optional reading is from these reference books: A: AMPL K: Karloff M:
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
with an integrality gap of almost 2 | Coursera
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
18.1 Graph Partitioning Problems
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
Integer Programs and Network Models
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming Introduction
CS261 Lecture14: Algorithms in Bipartite Graphs | in theory
MINIMUM COST FLOWS: BASIC ALGORITHMS
Optimization over Polynomials: Selected Topics
SDP gaps and UGC-hardness for Max-Cut-Gain
On the Complexity of Unique Games and Graph Expansion
Lovász-Schrijver Reformulation
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
