On the public citation graph
The equipartition polytope. II: Valid inequalities and facets
0 signed · 41 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.1007/bf01588778openalex-snapshot
The equipartition polytope. I: Formulations, dimension and basic facets
inferredcites →https://doi.org/10.1287/moor.10.2.340openalex-snapshot
Facets of the Bipartite 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.1002/nav.10084openalex-snapshot
Realignment in the National Football League: Did they do it right?
inferred← citeshttps://doi.org/10.1002/net.22257openalex-snapshot
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_23openalex-snapshot
A New Tabu Search Approach to the 0–1 Equicut Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_2openalex-snapshot
Engineering Branch-and-Cut Algorithms for the Equicut Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_8openalex-snapshot
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
inferred← citeshttps://doi.org/10.1007/bf01580898openalex-snapshot
Facets for the cut cone II: Clique-web inequalities
inferred← citeshttps://doi.org/10.1007/bf01581147openalex-snapshot
A computational study of graph partitioning
inferred← citeshttps://doi.org/10.1007/bf02032130openalex-snapshot
A projection technique for partitioning the nodes of a graph
inferred← citeshttps://doi.org/10.1007/bf02592198openalex-snapshot
Formulations and valid inequalities for the node capacitated graph partitioning problem
inferred← citeshttps://doi.org/10.1007/bf02614373openalex-snapshot
A branch-and-cut algorithm for the equicut problem
inferred← citeshttps://doi.org/10.1007/s12532-012-0040-5openalex-snapshot
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
inferred← citeshttps://doi.org/10.1007/s12532-022-00221-5openalex-snapshot
Political districting to minimize cut edges
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/j.cor.2010.07.014openalex-snapshot
A branch-and-cut algorithm for the partitioning-hub location-routing problem
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.020openalex-snapshot
A polyhedral approach for a constrained quadratic 0–1 problem
inferred← citeshttps://doi.org/10.1016/j.dam.2014.05.032openalex-snapshot
On the polyhedral structure of uniform cut polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2010.08.009openalex-snapshot
Size-constrained graph partitioning polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2011.01.018openalex-snapshot
From equipartition to uniform cut polytopes: Extended polyhedral results
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.2017.03.001openalex-snapshot
Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00039-5openalex-snapshot
Cardinality constrained Boolean quadratic polytope
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00287-7openalex-snapshot
Solution of large weighted equicut problems
inferred← citeshttps://doi.org/10.1023/b:joco.0000031417.96218.26openalex-snapshot
b-Tree Facets for the Simple Graph Partitioning Polytope
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/060675253openalex-snapshot
On the Graph Bisection Cut Polytope
inferred← citeshttps://doi.org/10.1287/ijoc.12.3.177.12637openalex-snapshot
Solving Graph Bisection Problems with Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/mnsc.46.3.363.12066openalex-snapshot
Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
inferred← citeshttps://doi.org/10.1287/opre.39.5.824openalex-snapshot
An Operation Partitioning Problem for Automated Assembly System Design
inferred← citeshttps://doi.org/10.15388/20-infor391openalex-snapshot
A Complementary Column Generation Approach for the Graph Equipartition Problem
inferred← citeshttps://doi.org/10.7282/t3sb4419openalex-snapshot
Two applications of 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.