On the public citation graph
Facets for the cut cone I
0 signed · 82 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230210602openalex-snapshot
The cut cone, L1 embeddability, complexity, and multicommodity flows
inferredcites →https://doi.org/10.1007/bf01303512openalex-snapshot
The hypermetric cone is polyhedral
inferredcites →https://doi.org/10.1007/bf01580870openalex-snapshot
Facets of the clique partitioning polytope
inferredcites →https://doi.org/10.1007/bf01580898openalex-snapshot
Facets for the cut cone II: Clique-web inequalities
inferredcites →https://doi.org/10.1007/bf01587084openalex-snapshot
Experiments in quadratic 0–1 programming
inferredcites →https://doi.org/10.1007/bf01588778openalex-snapshot
The equipartition polytope. I: Formulations, dimension and basic facets
inferredcites →https://doi.org/10.1007/bf01588779openalex-snapshot
The equipartition polytope. II: Valid inequalities and facets
inferredcites →https://doi.org/10.1007/bf01589101openalex-snapshot
The boolean quadric polytope: Some characteristics, facets and relatives
inferredcites →https://doi.org/10.1007/bf01788552openalex-snapshot
The classification of finite connected hypermetric spaces
inferredcites →https://doi.org/10.1016/0012-365x(90)90056-nopenalex-snapshot
The cut polytope and the Boolean quadric polytope
inferredcites →https://doi.org/10.1016/0012-365x(92)90133-zopenalex-snapshot
Compositions in the bipartite subgraph polytope
inferredcites →https://doi.org/10.1016/0012-365x(92)90690-hopenalex-snapshot
Max-cut in circulant graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90063-8openalex-snapshot
On the cycle polytope of a binary matroid
inferredcites →https://doi.org/10.1016/0167-6377(81)90020-1openalex-snapshot
Weakly bipartite graphs and the Max-cut problem
inferredcites →https://doi.org/10.1016/0167-6377(83)90016-0openalex-snapshot
The max-cut problem on graphs not contractible to K5
inferredcites →https://doi.org/10.1016/s0195-6698(13)80064-9openalex-snapshot
All Facets of the Cut Cone Cn for n = 7 are Known
inferredcites →https://doi.org/10.1016/s0195-6698(84)80022-0openalex-snapshot
Sur les Inégalités Valides dans L1
inferredcites →https://doi.org/10.1016/s0195-6698(89)80002-2openalex-snapshot
All the Facets of the Six-point Hamming Cone
inferredcites →https://doi.org/10.1137/0204019openalex-snapshot
Finding a Maximum Cut of a Planar Graph in Polynomial Time
inferredcites →https://doi.org/10.1287/moor.10.2.340openalex-snapshot
Facets of the Bipartite Subgraph Polytope
inferredcites →https://doi.org/10.1287/opre.13.3.388openalex-snapshot
Some Network Flow Problems Solved with Pseudo-Boolean Programming
inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
inferredcites →https://doi.org/10.21136/cpm.1987.108558openalex-snapshot
On a facet of the balanced subgraph polytope
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_20openalex-snapshot
The Semidefinite Relaxation of the k-Partition Polytope Is Strong
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_78openalex-snapshot
On skeletons, diameters and volumes of metric polyhedra
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_4openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_11openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-85181-0_2openalex-snapshot
A State-of-the-Art Cutting Plane Algorithm for Clique Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_9openalex-snapshot
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-58891-4_17openalex-snapshot
An Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_16openalex-snapshot
The Ridge Graph of the Metric Polytope and Some Relatives
inferred← citeshttps://doi.org/10.1007/bf01213466openalex-snapshot
Checking robust nonsingularity is NP-hard
inferred← citeshttps://doi.org/10.1007/bf01303512openalex-snapshot
The hypermetric cone is polyhedral
inferred← citeshttps://doi.org/10.1007/bf01580898openalex-snapshot
Facets for the cut cone II: Clique-web inequalities
inferred← citeshttps://doi.org/10.1007/s00454-024-00646-wopenalex-snapshot
On the Dominant of the Multicut Polytope
inferred← citeshttps://doi.org/10.1007/s10107-006-0018-zopenalex-snapshot
Generating facets for the cut polytope of a graph by triangular elimination
inferred← citeshttps://doi.org/10.1007/s10107-010-0352-zopenalex-snapshot
Binary positive semidefinite matrices and associated integer polytopes
inferred← citeshttps://doi.org/10.1007/s10479-005-3973-5openalex-snapshot
“Miniaturized” Linearizations for Quadratic 0/1 Problems
inferred← citeshttps://doi.org/10.1007/s11590-015-0953-9openalex-snapshot
Stochastic graph partitioning: quadratic versus SOCP formulations
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00471-3openalex-snapshot
Collapsing and lifting for the cut cone
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90544-popenalex-snapshot
Extension operations for cuts
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90116-bopenalex-snapshot
The even and odd cut polytopes
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00343-uopenalex-snapshot
The volume of relaxed Boolean-quadric and cut polytopes
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00271-ropenalex-snapshot
On a positive semidefinite relaxation of the cut polytope
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00741-5openalex-snapshot
The real positive semidefinite completion problem for series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0175-xopenalex-snapshot
Facets of the k-partition polytope
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00087-topenalex-snapshot
Hypercube embedding of generalized bipartite metrics
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00151-3openalex-snapshot
Some new classes of facets for the equicut polytope
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90020-5openalex-snapshot
Applications of cut polyhedra — I
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00299-5openalex-snapshot
An extended formulation approach to the edge-weighted maximal clique problem
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50043-9openalex-snapshot
10.1016/b978-044488002-4/50043-9
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.08.001openalex-snapshot
Facet-defining inequalities for the simple graph partitioning polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100757openalex-snapshot
A polyhedral study of lifted multicuts
inferred← citeshttps://doi.org/10.1016/j.orl.2010.05.004openalex-snapshot
Small bipartite subgraph polytopes
inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.005openalex-snapshot
Generalised 2-circulant inequalities for the max-cut problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00449-xopenalex-snapshot
A Lagrangian relaxation approach to the edge-weighted clique problem
inferred← citeshttps://doi.org/10.1017/s0963548300001115openalex-snapshot
Lattice Points of Cut Cones
inferred← citeshttps://doi.org/10.1023/a:1009898604624openalex-snapshot
A Semidefinite Programming Approach to the Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1023/a:1018972400378openalex-snapshot
On the boolean-quadric packinguncapacitated facility-location polytope
inferred← citeshttps://doi.org/10.1080/10556789408805564openalex-snapshot
A cutting plane algorithm for the max-cut problem
inferred← citeshttps://doi.org/10.1090/dimacs/020/01openalex-snapshot
Hypermetrics in geometry of numbers
inferred← citeshttps://doi.org/10.1111/1467-9574.00104openalex-snapshot
Polyhedral techniques in combinatorial optimization II: applications and computations
inferred← citeshttps://doi.org/10.1137/s1052623497324242openalex-snapshot
Computational Experience with an Interior Point Cutting Plane Algorithm
inferred← citeshttps://doi.org/10.1145/2133803.2330084openalex-snapshot
An SDP approach to multi-level crossing minimization
inferred← citeshttps://doi.org/10.1287/moor.17.4.981openalex-snapshot
Clique-Web Facets for Multicut Polytopes
inferred← citeshttps://doi.org/10.1287/moor.2023.0019openalex-snapshot
Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions
inferred← citeshttps://doi.org/10.1287/moor.27.4.740.301openalex-snapshot
A Note on Clique-Web Facets for Multicut Polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06017openalex-snapshot
On the cone of weighted graphs generated by triangles
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.