On the public citation graph
Efficient enumeration of the vertices of polyhedra associated with network LP's
0 signed · 46 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.1975.5.3.237openalex-snapshot
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
inferredcites →https://doi.org/10.1007/bf01593771openalex-snapshot
An algorithm for determining all extreme points of a convex polytope
inferredcites →https://doi.org/10.1007/bf02162916openalex-snapshot
Finding all vertices of a convex polyhedron
inferredcites →https://doi.org/10.1007/bf02242366openalex-snapshot
An algorithm for enumerating all vertices of a convex polyhedron
inferredcites →https://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferredcites →https://doi.org/10.1016/s0167-5060(08)70752-0openalex-snapshot
Vertex Generation Methods for Problems with Logical Constraints
inferredcites →https://doi.org/10.1057/jors.1978.105openalex-snapshot
Linear Programming and Network Flows
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1137/0109008openalex-snapshot
An Algorithm for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1145/109648.109659openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1287/moor.5.2.167openalex-snapshot
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1287/moor.8.3.381openalex-snapshot
The Complexity of Vertex Enumeration Methods
inferredcites →https://doi.org/10.1287/opre.21.1.247openalex-snapshot
An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
inferredcites →https://doi.org/10.1287/opre.23.3.555openalex-snapshot
Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
inferredcites →https://doi.org/10.1515/9781400881970-004openalex-snapshot
3. The Double Description Method
inferredcites →https://doi.org/10.1515/9781400881987-004openalex-snapshot
3 . Resolution and Separation Theorems for Polyhedral Convex Sets
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-45066-1_6openalex-snapshot
Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_18openalex-snapshot
Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_2openalex-snapshot
Some Algorithmic Problems in Polytope Theory
inferred← citeshttps://doi.org/10.1007/bf01961544openalex-snapshot
A Paradigm for Listing ($s,t$)-Cuts in Graphs
inferred← citeshttps://doi.org/10.1007/s00454-006-1259-6openalex-snapshot
Generating All Vertices of a Polyhedron Is Hard
inferred← citeshttps://doi.org/10.1007/s00454-008-9050-5openalex-snapshot
Generating All Vertices of a Polyhedron Is Hard
inferred← citeshttps://doi.org/10.1007/s10479-010-0690-5openalex-snapshot
The negative cycles polyhedron and hardness of checking some polyhedral properties
inferred← citeshttps://doi.org/10.1007/s11590-008-0103-8openalex-snapshot
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
inferred← citeshttps://doi.org/10.1016/j.dam.2025.10.042openalex-snapshot
An efficient algorithm for vertex enumeration of arrangement
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00023-5openalex-snapshot
How good are convex hull algorithms?
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00021-2openalex-snapshot
The vertex set of a 01-polytope is strongly P-enumerable
inferred← citeshttps://doi.org/10.1090/crmp/048/02openalex-snapshot
Generating vertices of polyhedra and related problems of monotone generation
inferred← citeshttps://doi.org/10.1109/iscas.1995.521464openalex-snapshot
Stability of a circuit with parasitic capacitances
inferred← citeshttps://doi.org/10.1137/1.9781611974782.122openalex-snapshot
An O(nm) time algorithm for finding the min length directed cycle in a graph
inferred← citeshttps://doi.org/10.1137/18m1198995openalex-snapshot
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices
inferred← citeshttps://doi.org/10.1145/1247069.1247124openalex-snapshot
On the hardness of minkowski addition and related operations
inferred← citeshttps://doi.org/10.1145/1970353.1970368openalex-snapshot
A Metric for Quantifying Similarity between Timing Constraint Sets in Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3173127.3173138openalex-snapshot
Computational Geometry Column 66
inferred← citeshttps://doi.org/10.1590/0101-7438.2022.042.00254570openalex-snapshot
VERTEX ENUMERATION OF POLYHEDRA
inferred← citeshttps://doi.org/10.22028/d291-25948openalex-snapshot
Complexity of some polyhedral enumeration problems
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d85openalex-snapshot
Farkas certificates and minimal witnesses for probabilistic reachability constraints
inferred← citeshttps://doi.org/10.3929/ethz-a-005945733openalex-snapshot
Large scale methods to enumerate extreme rays and elementary modes
inferred← citeshttps://doi.org/10.4230/lipics.swat.2018.18openalex-snapshot
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3790openalex-snapshot
Characterization of the Vertices and Extreme Directions of the Negative Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra
inferred← citeshttps://doi.org/10.5555/1109557.1109640openalex-snapshot
Generating all vertices of a polyhedron is hard
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.