On the public citation graph

Least distance methods for the scheme of polytopes

https://doi.org/10.1007/bf01608995
0 signed · 40 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.1007/bf01580381openalex-snapshot
Finding the nearest point in A polytope
inferredcites →https://doi.org/10.1007/bf01584323openalex-snapshot
Simplicial decomposition in nonlinear programming algorithms
inferredcites →https://doi.org/10.1007/bf01681343openalex-snapshot
A finite algorithm to maximize certain pseudoconcave functions on polytopes
inferredcites →https://doi.org/10.1007/bf02162916openalex-snapshot
Finding all vertices of a convex polyhedron
inferredcites →https://doi.org/10.1063/1.431987openalex-snapshot
Stability of the bromate–cerium–malonic acid network. I. Theoretical formulation
inferredcites →https://doi.org/10.1063/1.431988openalex-snapshot
Stability of the bromate–cerium–malonic acid network. II. Steady state formic acid case
inferredcites →https://doi.org/10.1137/0109008openalex-snapshot
An Algorithm for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1137/0126045openalex-snapshot
Generating All the Faces of a Polyhedron
inferredcites →https://doi.org/10.1137/0202023openalex-snapshot
An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone
inferredcites →https://doi.org/10.1145/321556.321564openalex-snapshot
An Algorithm for Convex Polytopes
inferredcites →https://doi.org/10.1287/mnsc.12.7.588openalex-snapshot
Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
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.22.1.151openalex-snapshot
Generation of the Admissible Boundary of a Convex Polytope
inferredcites →https://doi.org/10.1515/9781400881970-004openalex-snapshot
3. The Double Description Method
inferredcites →https://doi.org/10.21236/ad0659301openalex-snapshot
PROJECTIONS OF CONVEX POLYHEDRAL SETS
inferredcites →https://doi.org/10.2307/1907845openalex-snapshot
Optimality and Degeneracy in Linear Programming
inferredcites →https://doi.org/10.2307/2982329openalex-snapshot
Estimating Efficient Production Functions under Increasing Returns to Scale
inferredcites →https://doi.org/10.6028/jres.071b.001openalex-snapshot
Algorithms for frames and lineality spaces of cones

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470142622.ch1openalex-snapshot
Stability of Complex Reaction Networks
inferred← citeshttps://doi.org/10.1002/mana.19891420113openalex-snapshot
A Unified Constructive Approach to the Topological Degree in Rn
inferred← citeshttps://doi.org/10.1007/bf01584244openalex-snapshot
Finding simplicial subdivisions of polytopes
inferred← citeshttps://doi.org/10.1007/bf01600236openalex-snapshot
An output error model and algorithm for electromagnetic system identification
inferred← citeshttps://doi.org/10.1016/0022-2496(88)90044-2openalex-snapshot
A probabilistic dominance measure for binary choices: Analytic aspects of a multi-attribute random weights model
inferred← citeshttps://doi.org/10.1016/0041-5553(81)90008-2openalex-snapshot
A new algorithm for solving the discrete programming problem
inferred← citeshttps://doi.org/10.1016/0041-5553(88)90010-9openalex-snapshot
Construction of the convex hull of a finite set of points when the computations are approximate
inferred← citeshttps://doi.org/10.1016/0094-1190(84)90017-2openalex-snapshot
Predation among supermarkets: An algorithmic locational analysis
inferred← citeshttps://doi.org/10.1016/0377-0427(87)90192-0openalex-snapshot
Least distance methods for the frame of homogeneous equation systems
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90327-5openalex-snapshot
An algorithm for set operations on nonconvex polygons (with an application to census tracts)
inferred← citeshttps://doi.org/10.1016/0378-4754(90)90004-3openalex-snapshot
Fast and robust algorithm to compute exact polytope parameter bounds
inferred← citeshttps://doi.org/10.1016/b978-044451719-7/50053-6openalex-snapshot
Finding minima, transition states, and following reaction pathways on ab initio potential energy surfaces
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.1313openalex-snapshot
A Polytopic Box Particle Filter for state estimation of Non Linear Discrete-Time Systems
inferred← citeshttps://doi.org/10.1063/1.448955openalex-snapshot
Chemical reaction networks with finite attractor regions
inferred← citeshttps://doi.org/10.1063/1.452991openalex-snapshot
Bistability in chemical reaction networks: Theory and application to the peroxidase–oxidase reaction
inferred← citeshttps://doi.org/10.1080/02522667.1988.10698917openalex-snapshot
Avoiding Modified Matrix Factorizations in Newton-like Methods
inferred← citeshttps://doi.org/10.1090/s0025-5718-1986-0815838-7openalex-snapshot
Computing Volumes of Polyhedra
inferred← citeshttps://doi.org/10.1109/robot.1990.126064openalex-snapshot
Optimal grasping using a multifingered robot hand
inferred← citeshttps://doi.org/10.1137/0135063openalex-snapshot
Asymptotes and Intercepts of Real-Power Polynomial Surfaces from the Geometry of the Exponent Polytope
inferred← citeshttps://doi.org/10.11650/tjm/260104openalex-snapshot
Methods for Identifying All Extreme Points of Convex Hulls in Spaces of Dimension Greater than 3 Revisited
inferred← citeshttps://doi.org/10.1246/bcsj.61.1827openalex-snapshot
Hindered Rotation around Csp2–Csp3 Bonds in the Enol Forms of α-(9-Fluorenyl)-β-diketones and in 3,5-Disubstituted 4-(9-Fluorenyl)pyrazoles. An 1H NMR Study
inferred← citeshttps://doi.org/10.1287/moor.8.3.381openalex-snapshot
The Complexity of Vertex Enumeration Methods
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.