Stronger linear programming relaxations of max-cut.
David AvisJun UmemotoPublished in: Math. Program. (2003)
Keyphrases
- max cut
- linear programming relaxation
- np hard
- knapsack problem
- linear programming
- lower bound
- graph model
- integer programming
- planar graphs
- np complete problems
- branch and bound
- feasible solution
- valid inequalities
- cutting plane
- mixed integer programming
- graph partitioning
- integer program
- spectral graph
- column generation
- binary variables
- dynamic programming
- optimal solution
- graph coloring
- branch and bound algorithm
- objective function
- phase transition
- approximation algorithms
- cost function
- traveling salesman problem