On the public citation graph

Facets for the cut cone II: Clique-web inequalities

https://doi.org/10.1007/bf01580898
0 signed · 50 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.
Claim with ORCID
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.
See reference health

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/bf01580897openalex-snapshot
Facets for the cut cone I
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/bf02592023openalex-snapshot
On the cut polytope
inferredcites →https://doi.org/10.1016/0012-365x(93)90115-aopenalex-snapshot
The inequicut cone
inferredcites →https://doi.org/10.1016/s0167-5060(08)70874-4openalex-snapshot
Espaces Métriques Plongeables Dans Un Hypercube: Aspects Combinatoires
inferredcites →https://doi.org/10.1016/s0195-6698(13)80049-2openalex-snapshot
The CW-Inequalities for Vectors in l1
inferredcites →https://doi.org/10.1090/dimacs/004/16openalex-snapshot
The symmetries of the cut polytope and of some relatives
inferredcites →https://doi.org/10.1287/moor.10.2.340openalex-snapshot
Facets of the Bipartite Subgraph Polytope
inferredcites →https://doi.org/10.1287/moor.17.4.981openalex-snapshot
Clique-Web Facets for Multicut Polytopes
inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118600207.ch6openalex-snapshot
The Maximum Cut Problem
inferred← citeshttps://doi.org/10.1002/9781119005353.biblioopenalex-snapshot
General Bibliography
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-642-58891-4_17openalex-snapshot
An Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems
inferred← citeshttps://doi.org/10.1007/bf01303512openalex-snapshot
The hypermetric cone is polyhedral
inferred← citeshttps://doi.org/10.1007/bf01580897openalex-snapshot
Facets for the cut cone I
inferred← citeshttps://doi.org/10.1007/bf02988300openalex-snapshot
The cut cone III: On the role of triangle facets
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/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(93)90115-aopenalex-snapshot
The inequicut cone
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90116-bopenalex-snapshot
The even and odd cut polytopes
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)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/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.1023/a:1009898604624openalex-snapshot
A Semidefinite Programming Approach to the Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1023/a:1026498519948openalex-snapshot
Newton-Type Methods for Quasidifferentiable Equations
inferred← citeshttps://doi.org/10.1080/00150517.1992.12429384openalex-snapshot
The Fibonacci and Parachute Inequalities for l 1 -Metrics
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.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.1515/advgeom-2023-0014openalex-snapshot
On the bond polytope
inferred← citeshttps://doi.org/10.26481/umamet.1995014openalex-snapshot
Polyhedral Techniques in Combinatorial Optimization
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.