Pages that link to "Item:Q688915"
From MaRDI portal
The following pages link to On cuts and matchings in planar graphs (Q688915):
Displayed 25 items.
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Generalized cut and metric polytopes of graphs and simplicial complexes (Q2174869) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- (Q4633022) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)