On the public citation graph
Finding all vertices of a convex polyhedron
0 signed · 87 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.1080/00029890.1955.11988636openalex-snapshot
The Number of Vertices of a Polyhedron
inferredcites →https://doi.org/10.1137/0109008openalex-snapshot
An Algorithm for Finding All Vertices of Convex Polyhedral Sets
inferredcites →https://doi.org/10.1515/9781400881970-004openalex-snapshot
3. The Double Description Method
inferredcites →https://doi.org/10.2307/1910003openalex-snapshot
Studies in Linear and Nonlinear Programming
inferredcites →https://doi.org/10.2307/2342801openalex-snapshot
Studies in Linear and Non-Linear Programming.
inferredcites →https://doi.org/10.4153/cjm-1964-067-6openalex-snapshot
On the Number of Vertices of a Convex 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/cta.4490080104openalex-snapshot
On the generation and optimization of equivalent ladder networks
inferred← citeshttps://doi.org/10.1002/nav.3800230406openalex-snapshot
Zero‐sum games with multiple goals
inferred← citeshttps://doi.org/10.1006/jsco.1993.1041openalex-snapshot
Parallel Scheduling of Recursively Defined Arrays: Revisited
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_22openalex-snapshot
Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows
inferred← citeshttps://doi.org/10.1007/978-3-030-96318-7_14openalex-snapshot
Interactive Multicriteria Methodology Based on a Synergy of PROMETHEE II and Robust Simos Methods: Application to the Evaluation of E-government in Europe
inferred← citeshttps://doi.org/10.1007/978-3-319-11364-7_15openalex-snapshot
Robustness Analysis in Multicriteria Disaggregation – Aggregation Approaches for Group Decision Making
inferred← citeshttps://doi.org/10.1007/978-3-319-62338-2_8openalex-snapshot
Robust Evaluation of Risks in Ship-to-Ship Transfer Operations: Application of the STOCHASTIC UTA Multicriteria Decision Support Method
inferred← citeshttps://doi.org/10.1007/978-3-319-65052-4_13openalex-snapshot
Disaggregation Approach to Value Elicitation
inferred← citeshttps://doi.org/10.1007/978-3-642-68997-0_65openalex-snapshot
An Algorithm for Decision Oriented Factor and Process Evaluation and its Implementation
inferred← citeshttps://doi.org/10.1007/978-3-642-95316-3_10openalex-snapshot
Eckpunktbestimmung Konvexer Polyeder
inferred← citeshttps://doi.org/10.1007/978-3-642-99745-7_20openalex-snapshot
Zur multiparametrischen linearen Programmierung
inferred← citeshttps://doi.org/10.1007/978-3-642-99749-5_4openalex-snapshot
Die Konstruktion der Lösungsmenge eines allgemeinen linearen Restriktionssystems
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_9openalex-snapshot
Algorithms for Imprecise Probabilities
inferred← citeshttps://doi.org/10.1007/bf00939135openalex-snapshot
On the structure of the set bases of a degenerate point
inferred← citeshttps://doi.org/10.1007/bf00939219openalex-snapshot
Polyhedral functions and multiparametric linear programming
inferred← citeshttps://doi.org/10.1007/bf00940691openalex-snapshot
Unrestricted variables in linear programming
inferred← citeshttps://doi.org/10.1007/bf01437214openalex-snapshot
An algorithm for determining redundant inequalities and all solutions to convex polyhedra
inferred← citeshttps://doi.org/10.1007/bf01582058openalex-snapshot
Efficient enumeration of the vertices of polyhedra associated with network LP's
inferred← citeshttps://doi.org/10.1007/bf01584324openalex-snapshot
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
inferred← citeshttps://doi.org/10.1007/bf01593771openalex-snapshot
An algorithm for determining all extreme points of a convex polytope
inferred← citeshttps://doi.org/10.1007/bf01608995openalex-snapshot
Least distance methods for the scheme of polytopes
inferred← citeshttps://doi.org/10.1007/bf01935004openalex-snapshot
Pivoting rules and redundancy schemes in extreme point enumeration
inferred← citeshttps://doi.org/10.1007/bf01939818openalex-snapshot
Eine Methode zur Berechnung des optimalen Produktionsprogramms bei konkaver Zielfunktion
inferred← citeshttps://doi.org/10.1007/bf02242366openalex-snapshot
An algorithm for enumerating all vertices of a convex polyhedron
inferred← citeshttps://doi.org/10.1007/bf02392139openalex-snapshot
Polytope pairs and their relationship to linear programming
inferred← citeshttps://doi.org/10.1007/bf02888377openalex-snapshot
Condiciones suficientes para la existencia de solucion optima en un programa semi-infinito
inferred← citeshttps://doi.org/10.1007/bf02888700openalex-snapshot
Representacion finita de sistemas de infinitas inecuaciones
inferred← citeshttps://doi.org/10.1007/s10107-009-0293-6openalex-snapshot
An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming
inferred← citeshttps://doi.org/10.1007/s10898-015-0384-2openalex-snapshot
Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints
inferred← citeshttps://doi.org/10.1007/s12351-018-0394-1openalex-snapshot
A visualization approach for robustness analysis in multicriteria disaggregation–aggregation approaches
inferred← citeshttps://doi.org/10.1016/0045-7825(84)90060-4openalex-snapshot
Extended variational formulations and F.E. models for nonlinear beams under nonconservative loading
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90019-7openalex-snapshot
Holistic algorithms: A paradigm for multiprocessor programming
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferred← citeshttps://doi.org/10.1016/0305-0483(81)90038-4openalex-snapshot
A survey of methodology for the global minimization of concave functions subject to convex constraints
inferred← citeshttps://doi.org/10.1016/0305-0548(78)90025-4openalex-snapshot
A global algorithm for minimax solutions to a stochastic programming problem
inferred← citeshttps://doi.org/10.1016/0305-0548(86)90034-1openalex-snapshot
An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90027-2openalex-snapshot
Enumerating extreme points of a highly degenerate polytope
inferred← citeshttps://doi.org/10.1016/0377-0427(92)90083-aopenalex-snapshot
On computing the exact value of dispersion of a sequence
inferred← citeshttps://doi.org/10.1016/0377-2217(80)90040-5openalex-snapshot
Enumerative technique for an extreme point fractional program
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90155-2openalex-snapshot
Assessing a set of additive utility functions for multicriteria decision-making, the UTA method
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90180-1openalex-snapshot
An improved vertex enumeration algorithm
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90290-xopenalex-snapshot
Plausibility relations and multiple expected utilities in decision-making under uncertainty
inferred← citeshttps://doi.org/10.1016/b978-0-12-775950-0.50011-xopenalex-snapshot
Methods for Estimating Discrepancy
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.04.037openalex-snapshot
Elicitation of criteria importance weights through the Simos method: A robustness concern
inferred← citeshttps://doi.org/10.1016/j.jeconom.2013.05.005openalex-snapshot
Binary choice models with discrete regressors: Identification and misspecification
inferred← citeshttps://doi.org/10.1016/j.jmaa.2022.126592openalex-snapshot
The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00172-5openalex-snapshot
On solving vague systems of linear equations with pattern-shaped columns
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00073-1openalex-snapshot
A recursive algorithm for volume-based sensitivity analysis of linear decision models
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00095-8openalex-snapshot
Optimization over the efficient set of a parametric multiple objective linear programming problem
inferred← citeshttps://doi.org/10.1051/ro/1980140100531openalex-snapshot
Comment modéliser les préférences au moyen de fonctions d'utilité auditives
inferred← citeshttps://doi.org/10.1051/ro/1984180403811openalex-snapshot
Le traitement des solutions quasi optimales en programmation linéaire continue : une synthèse
inferred← citeshttps://doi.org/10.1080/01605682.2019.1590132openalex-snapshot
A parametric programming approach to bilevel optimisation with lower-level variables in the upper level
inferred← citeshttps://doi.org/10.1080/02331934.2014.926357openalex-snapshot
A common formula to compute the efficient sets of a class of multiple objective linear programming problems
inferred← citeshttps://doi.org/10.1080/02331939708844325openalex-snapshot
A Calculation of all Separating Hyperplanes of two Convex Polytopes
inferred← citeshttps://doi.org/10.1080/02331939808844377openalex-snapshot
On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
inferred← citeshttps://doi.org/10.1080/02331939808844378openalex-snapshot
Separating support hyperplanes for a pair of convex polyhedral sets
inferred← citeshttps://doi.org/10.1080/02522667.1993.10699137openalex-snapshot
Extreme point Quadratic Minimization Problem
inferred← citeshttps://doi.org/10.1090/s0025-5718-1991-1079024-2openalex-snapshot
Polytope volume computation
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/9.83532openalex-snapshot
Linear systems with state and control constraints: the theory and application of maximal output admissible sets
inferred← citeshttps://doi.org/10.1109/cis.2009.139openalex-snapshot
An Approach for a Class of Bilevel Multiobjective Programming Problem
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417114openalex-snapshot
Analysis and Optimization of Caching and Multicasting in Large-Scale Cache-Enabled Information-Centric Networks
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417114openalex-snapshot
Analysis and Optimization of Caching and Multicasting in Large-Scale Cache-Enabled Information-Centric Networks
inferred← citeshttps://doi.org/10.1109/iscas.1988.15149openalex-snapshot
Finding multiple solutions of piecewise-affine resistive circuits
inferred← citeshttps://doi.org/10.1109/tit.2006.876356openalex-snapshot
Voronoi cells, probabilistic bounds, and hypothesis testing in mixed integer linear models
inferred← citeshttps://doi.org/10.1145/169728.169719openalex-snapshot
Dimension-independent modeling with simplicial complexes
inferred← citeshttps://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferred← citeshttps://doi.org/10.1186/s13015-025-00296-4openalex-snapshot
An efficient algorithm for exploring RNA branching conformations under the nearest-neighbor thermodynamic model
inferred← citeshttps://doi.org/10.1287/mnsc.18.7.406openalex-snapshot
Multiparametric Linear Programming
inferred← citeshttps://doi.org/10.1287/mnsc.23.2.159openalex-snapshot
Linear Multiparametric Programming by Multicriteria Simplex Method
inferred← citeshttps://doi.org/10.1287/moor.5.2.167openalex-snapshot
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
inferred← citeshttps://doi.org/10.1287/moor.8.3.381openalex-snapshot
The Complexity of Vertex Enumeration Methods
inferred← citeshttps://doi.org/10.1287/opre.21.1.247openalex-snapshot
An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
inferred← citeshttps://doi.org/10.21136/am.1979.103797openalex-snapshot
The determination of necessary and sufficient conditions for the existence of a solution to the $3\times3\times3$ multi-index problem
inferred← citeshttps://doi.org/10.23919/acc.1991.4791387openalex-snapshot
Linear Systems with Output Constraints: The Theory and Application of Maximal Output Admissible Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00790openalex-snapshot
The multidimensional truncated Moment Problem: Shape and Gaussian Mixture Reconstruction from Derivatives of Moments
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.