Optimization over Polynomials: Selected Topics
A Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
1 The Algorithm of Goemans and Williamson
Integer Programs and Network Models
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
arXiv:1801.07937v3 [cs.DM] 12 Jan 2019
Maximum cut - Wikipedia
PDF) On the Configuration-LP for Scheduling on Unrelated Machines
PDF) Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
A Randomized Rounding Approach to the Traveling Salesman Problem
Integrality Gaps for Sherali–Adams Relaxations
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming
Lovász-Schrijver Reformulation
MINIMUM COST FLOWS: BASIC ALGORITHMS
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
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
