Pages that link to "Item:Q593988"
From MaRDI portal
The following pages link to The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988):
Displaying 50 items.
- A nonmonotone GRASP (Q340011) (← links)
- Computing the Grothendieck constant of some graph classes (Q408441) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Ideal clutters (Q697573) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- Maximum cut on line and total graphs (Q1304481) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Minimizing breaks by maximizing cuts. (Q1400343) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Master polytopes for cycles of binary matroids (Q1824625) (← links)
- The cut polytope and the Boolean quadric polytope (Q1825140) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Hilbert bases of cuts (Q1916115) (← links)
- Seminormality, canonical modules, and regularity of cut polytopes (Q1979324) (← links)
- Generalized cut and metric polytopes of graphs and simplicial complexes (Q2174869) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- On fractional cut covers (Q2312658) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- A decomposition theory for matroids. IV: Decomposition of graphs (Q2639863) (← links)
- Enumeration of the facets of cut polytopes over some highly symmetric graphs (Q2827757) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
