Generating facets for the cut polytope of a graph by triangular elimination.
David AvisHiroshi ImaiTsuyoshi ItoPublished in: Math. Program. (2008)
Keyphrases
- facet defining inequalities
- stable set
- facet defining
- directed graph
- hamiltonian cycle
- graph theory
- mixed integer
- graph structure
- vertex set
- random walk
- planar graphs
- graph theoretic
- graph representation
- graph mining
- valid inequalities
- weighted graph
- integer programming problems
- convex hull
- graph model
- bipartite graph
- lattice points
- swendsen wang
- dependency graph
- link analysis
- knapsack problem
- neural network