The following pages link to On the cut polytope (Q4726054):
Displaying 50 items.
- On the diameter of cut polytopes (Q271649) (← links)
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769) (← links)
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Combinatorial and geometric properties of the max-cut and min-cut problems (Q393848) (← links)
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Computing the Grothendieck constant of some graph classes (Q408441) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- The inequicut cone (Q688255) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Compressed polytopes and statistical disclosure limitation (Q875709) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Normality of cut polytopes of graphs is a minor closed property (Q966011) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Experiments in quadratic 0-1 programming (Q1123806) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← 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)
- Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
