On the public citation graph
The hypermetric cone is polyhedral
0 signed · 52 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.1002/zamm.19670470229openalex-snapshot
O. M. Nikodým, The Mathematical Apparatus for Quantum‐Theories. (Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Band 129) X + 952 S. Berlin/Heidelberg/New York 1966. Springer‐Verlag. Preis geb. DM 144,–
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/bf01193107openalex-snapshot
�ber zwei Probleme bez�glich konvexer K�rper von P. Erd�s und von V. L. Klee
inferredcites →https://doi.org/10.1007/bf01580898openalex-snapshot
Facets for the cut cone II: Clique-web inequalities
inferredcites →https://doi.org/10.1007/bf01788552openalex-snapshot
The classification of finite connected hypermetric spaces
inferredcites →https://doi.org/10.1016/0195-6698(92)90021-qopenalex-snapshot
Computing extreme rays of the metric cone for seven points
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(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.1515/crll.1908.134.198openalex-snapshot
Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.4153/cjm-1980-010-0openalex-snapshot
On the Extreme Rays of the Metric Cone
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_4openalex-snapshot
The Boolean Quadric Polytope
inferred← citeshttps://doi.org/10.1007/978-3-0348-8201-9_30openalex-snapshot
The Median Extension of Data Analysis Metric Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_6openalex-snapshot
On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_18openalex-snapshot
Semidefinite Relaxations for Integer Programming
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/bf00186527openalex-snapshot
Delaunay transformations of a Delaunay polytope
inferred← citeshttps://doi.org/10.1007/bf01580072openalex-snapshot
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
inferred← citeshttps://doi.org/10.1007/bf01580898openalex-snapshot
Facets for the cut cone II: Clique-web inequalities
inferred← citeshttps://doi.org/10.1007/bf02574028openalex-snapshot
Lattice-free polytopes and their diameter
inferred← citeshttps://doi.org/10.1007/s10107-003-0423-5openalex-snapshot
Stronger linear programming relaxations of max-cut
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/s10288-012-0210-3openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10479-015-2015-1openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90020-5openalex-snapshot
Applications of cut polyhedra — I
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90021-3openalex-snapshot
Applications of cut polyhedra — II
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.ejc.2003.07.004openalex-snapshot
The six-dimensional Delaunay polytopes
inferred← citeshttps://doi.org/10.1016/j.jmva.2018.07.014openalex-snapshot
Membership testing for Bernoulli and tail-dependence matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2010.06.038openalex-snapshot
On a class of metrics related to graph layout problems
inferred← citeshttps://doi.org/10.1016/j.orl.2012.01.010openalex-snapshot
Complexity results for the gap inequalities for the max-cut problem
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)00242-5openalex-snapshot
Finite metric spaces of strictly negative type
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00097-xopenalex-snapshot
Semidefinite programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1023/a:1014803008920openalex-snapshot
Affine Types of $$L $$ -Polyhedra for $$5 $$ -lattices
inferred← citeshttps://doi.org/10.1023/a:1022436313513openalex-snapshot
Delaunay Transformations of a Delaunay Polytope
inferred← citeshttps://doi.org/10.1080/01966324.2002.10737587openalex-snapshot
Small Cones of Oriented Semi-Metrics
inferred← citeshttps://doi.org/10.1080/10586458.2003.10504511openalex-snapshot
The Hypermetric Cone on Seven Vertices
inferred← citeshttps://doi.org/10.1137/0805024openalex-snapshot
Nonpolyhedral Relaxations of Graph-Bisection Problems
inferred← citeshttps://doi.org/10.1142/9789814366311_0012openalex-snapshot
Cones of Weighted and Partial Metrics
inferred← citeshttps://doi.org/10.3138/infor.53.1.40openalex-snapshot
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
inferred← citeshttps://doi.org/10.4213/mzm356openalex-snapshot
Аффинные типы $L$-многогранников 5-мерных решеток
inferred← citeshttps://doi.org/10.48550/arxiv.0709.0910openalex-snapshot
On a class of metrics related to graph layout problems
inferred← citeshttps://doi.org/10.48550/arxiv.0905.4555openalex-snapshot
Perfect but not generating Delaunay polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0108177openalex-snapshot
The hypermetric cone on seven vertices
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.