Integer Programs and Network Models
A Unified Approach to Mixed-Integer Optimization: Nonlinear Formulations and Scalable Algorithms
Untitled
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
A Randomized Rounding Approach to the Traveling Salesman Problem
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
CS261 Lecture14: Algorithms in Bipartite Graphs | in theory
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Optimization over Polynomials: Selected Topics
18.1 Graph Partitioning Problems
arXiv:1801.07937v3 [cs.DM] 12 Jan 2019
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
Maximum cut - Wikipedia
SDP gaps and UGC-hardness for Max-Cut-Gain
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
Integer Programs and Network Models
PDF) Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
PDF) On the Configuration-LP for Scheduling on Unrelated Machines
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming
