Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
On the Complexity of Unique Games and Graph Expansion
CS261 Lecture14: Algorithms in Bipartite Graphs | in theory
Maximum cut - Wikipedia
Approximation Algorithms CS599 Homework 3 Date: December 5, 2014 Due: December 12, 2014 1. Discrepancy. Consider a set system S
Convex Relaxations and Integrality Gaps
Integer Programs and Network Models
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
arXiv:1801.07937v3 [cs.DM] 12 Jan 2019
PDF) Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming Introduction
Lovász-Schrijver Reformulation
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
CSCI 5654 Handout List Required reading is from Chvátal. Optional reading is from these reference books: A: AMPL K: Karloff M:
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
PDF) On the Configuration-LP for Scheduling on Unrelated Machines
Integer Programs and Network Models
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
