On the public citation graph
Polyhedral sets having a least element
0 signed · 114 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/bf01696240openalex-snapshot
ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ
inferredcites →https://doi.org/10.1016/0024-3795(68)90002-5openalex-snapshot
Extreme points of leontief substitution systems
inferredcites →https://doi.org/10.1090/procopenalex-snapshot
Proceedings of the American Mathematical Society
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0097025-0openalex-snapshot
A partition theorem for Euclidean 𝑛-space
inferredcites →https://doi.org/10.1137/1010095openalex-snapshot
Characterizations of Real Matrices of Monotone Kind
inferredcites →https://doi.org/10.1515/9783112739716-001openalex-snapshot
Indifferente Optimierungsprobleme
inferredcites →https://doi.org/10.21136/cmj.1962.100526openalex-snapshot
On matrices with non-positive off-diagonal elements and positive principal minors
inferredcites →https://doi.org/10.2307/1910385openalex-snapshot
Optimal Solution of a Dynamic Leontief Model with Substitution
inferredcites →https://doi.org/10.2307/2371454openalex-snapshot
The Unloading Problem for Plane Curves
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199110)38:5<679::aid-nav3220380504>3.0.co;2-sopenalex-snapshot
A descent approach to solving the complementary programming problem
inferred← citeshttps://doi.org/10.1002/nav.3800260102openalex-snapshot
Convex/stochastic programming and multilocation inventory problems
inferred← citeshttps://doi.org/10.1002/nav.3800280106openalex-snapshot
Bounds and elimination in generalized markov decisions
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_469openalex-snapshot
Simplicial Pivoting Algorithms for Integer Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_616openalex-snapshot
Simplicial Pivoting Algorithms for Integer Programming
inferred← citeshttps://doi.org/10.1007/978-1-4612-2670-3_2openalex-snapshot
Hierarchical Modeling of Stochastic Networks, Part I: Fluid Models
inferred← citeshttps://doi.org/10.1007/978-1-4615-0893-9_7openalex-snapshot
A Study on Coefficient Reduction of Binary Knapsack Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/978-3-032-12331-2_7openalex-snapshot
Numerical Methods for Pricing American Put Options
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_30openalex-snapshot
Sparse Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46329-7_3openalex-snapshot
On Closed Sets Having A Least Element
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_15openalex-snapshot
Alternative Theorems for General Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf00047211openalex-snapshot
Variational inequalities and the pricing of American options
inferred← citeshttps://doi.org/10.1007/bf01098774openalex-snapshot
Analytical description of strong extremum in a convex set
inferred← citeshttps://doi.org/10.1007/bf01580374openalex-snapshot
A note on polyhedral sets having A least element
inferred← citeshttps://doi.org/10.1007/bf01580671openalex-snapshot
Linear complementarity problems solvable by A single linear program
inferred← citeshttps://doi.org/10.1007/bf01582097openalex-snapshot
On a class of least-element complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01582255openalex-snapshot
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
inferred← citeshttps://doi.org/10.1007/bf01582579openalex-snapshot
New algorithms for generalized network flows
inferred← citeshttps://doi.org/10.1007/bf01584990openalex-snapshot
Monotone solutions of the parametric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01585501openalex-snapshot
Minimality and complementarity properties associated with Z-functions and M-functions
inferred← citeshttps://doi.org/10.1007/bf01593768openalex-snapshot
Isotone solutions of parametric linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01593769openalex-snapshot
On monotonicity in parametric linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02061065openalex-snapshot
The generalized Leontief input-output model and its application to the choice of new technology
inferred← citeshttps://doi.org/10.1007/bf02283687openalex-snapshot
Interior-point algorithms for global optimization
inferred← citeshttps://doi.org/10.1007/bfb0035170openalex-snapshot
New algorithms for generalized network flows
inferred← citeshttps://doi.org/10.1007/bfb0063613openalex-snapshot
Numerical methods for complementarity problems in engineering and applied science
inferred← citeshttps://doi.org/10.1007/bfb0079164openalex-snapshot
On Minkowski matrices and the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bfb0120784openalex-snapshot
On solving linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1007/bfb0120787openalex-snapshot
On the parametric nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10479-018-2939-3openalex-snapshot
T. Parthasarathy’s contributions to complementarity problems: a survey
inferred← citeshttps://doi.org/10.1007/s10479-019-03186-2openalex-snapshot
A linear programming primer: from Fourier to Karmarkar
inferred← citeshttps://doi.org/10.1007/s10479-024-05980-zopenalex-snapshot
Projection methods for finding the greatest element of the intersection of max-closed convex sets
inferred← citeshttps://doi.org/10.1007/s10479-026-07064-6openalex-snapshot
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
inferred← citeshttps://doi.org/10.1007/s12597-019-00412-0openalex-snapshot
On hidden Z-matrix and interior point algorithm
inferred← citeshttps://doi.org/10.1016/0024-3795(77)90073-8openalex-snapshot
M-matrix characterizations.I—nonsingular M-matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90045-9openalex-snapshot
Linear complementarity problems and characterizations of Minkowski matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90077-0openalex-snapshot
On cone orderings and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90103-4openalex-snapshot
Hidden Z-matrices with positive principal minors
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90156-7openalex-snapshot
Matrices and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90264-wopenalex-snapshot
A class of linear complementarity problems solvable in polynomial time
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90130-gopenalex-snapshot
Locating service centers with precedence constraints
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90006-xopenalex-snapshot
Using separation algorithms in fixed dimension
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0295-9openalex-snapshot
The linear complementarity problem with a parametric input
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90256-9openalex-snapshot
On some classes of matrices related to solving linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1016/b978-0-12-358350-5.50004-xopenalex-snapshot
On the Need for a System Optimization Laboratory
inferred← citeshttps://doi.org/10.1016/b978-0-12-468660-1.50018-9openalex-snapshot
A SPECIAL CLASS OF LARGE QUADRATIC PROGRAMS11This research was supported by Air Force Office of Scientific Research Contract F44620-74-C-0079.
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50022-7openalex-snapshot
THE IMPLICIT COMPLEMENTARITY PROBLEM11This research was prepared as part of the activities of the Management Sciences Research Group, Carnegie-Mellon University, under Contract N00014-75-C-0621 NR 047-048 with the Office of Naval Research.
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50011-8openalex-snapshot
Integer Programming Problems for Which a Simple Rounding Type Algorithm Works
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.055openalex-snapshot
Disjunctive programming and the generalized Leontief input–output model
inferred← citeshttps://doi.org/10.1016/j.amc.2018.06.028openalex-snapshot
Pricing of American options, using the Brennan–Schwartz algorithm based on finite elements
inferred← citeshttps://doi.org/10.1016/j.laa.2010.12.031openalex-snapshot
Nonnegative generalized inverses and least elements of polyhedral sets
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00163-xopenalex-snapshot
On perfect 0, ± 1 matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00271-2openalex-snapshot
New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)67351-8openalex-snapshot
A Case for Relaxation Methods in Large Scale Linear Programming
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.008openalex-snapshot
Optimization Methods in Logic
inferred← citeshttps://doi.org/10.1023/a:1008224418676openalex-snapshot
The Generalized Linear Complementarity Problem: Least Element Theory and Z-Matrices
inferred← citeshttps://doi.org/10.1023/a:1013847510365openalex-snapshot
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs
inferred← citeshttps://doi.org/10.1023/b:anor.0000004768.22040.55openalex-snapshot
Production Equilibrium Point in Multi-Unit Manufacturing Systems and The Vertical Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1051/ro/1977110404051openalex-snapshot
Sur un modèle non-linéaire des rapports interindustriels
inferred← citeshttps://doi.org/10.1051/ro/1979130100751openalex-snapshot
A complementarity approach for solving Leontief substitution systems and (generalized) Markov decision processes
inferred← citeshttps://doi.org/10.1051/ro/1980140403491openalex-snapshot
A generalized Markov decision process
inferred← citeshttps://doi.org/10.1057/jors.1977.143openalex-snapshot
An Iterative Approach to Goal Programming
inferred← citeshttps://doi.org/10.1080/02331887508801265openalex-snapshot
Minimality and complementarity properties of s.c.Z-functions and a forgotten theorem due to Georg Wintgen
inferred← citeshttps://doi.org/10.1080/02331939608844162openalex-snapshot
Complementary irreducibilityS– matrices with connections to solutions of the linear complementarity problem
inferred← citeshttps://doi.org/10.1080/10556789708805648openalex-snapshot
An algorithm to solve the generalized linear complementarity problem with a vertical block z-matrix
inferred← citeshttps://doi.org/10.1109/etfa.2008.4638569openalex-snapshot
From monotone inequalities to Model Predictive Control
inferred← citeshttps://doi.org/10.1109/tase.2013.2290314openalex-snapshot
State Estimation of Timed Labeled Petri Nets With Unobservable Transitions
inferred← citeshttps://doi.org/10.1137/0316004openalex-snapshot
A Maximization Problem Related to Parametric Linear Complementarity
inferred← citeshttps://doi.org/10.1137/0317014openalex-snapshot
Value Convergence in a Generalized Markov Decision Process
inferred← citeshttps://doi.org/10.1137/0318005openalex-snapshot
Equivalence of Linear Complementarity Problems and Linear Programs in Vector Lattice Hilbert Spaces
inferred← citeshttps://doi.org/10.1137/0318046openalex-snapshot
Nonlinear Complementarity Problems in a Function Space
inferred← citeshttps://doi.org/10.1137/0328040openalex-snapshot
Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
inferred← citeshttps://doi.org/10.1137/0328076openalex-snapshot
Relationships Between Various Markovian Decision Problem Classes
inferred← citeshttps://doi.org/10.1137/0403014openalex-snapshot
Advantageous Properties of Dual Transhipment Polyhedra
inferred← citeshttps://doi.org/10.1137/22m1476733openalex-snapshot
Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
inferred← citeshttps://doi.org/10.1137/s0097539791256325openalex-snapshot
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1137/s0895479894271147openalex-snapshot
Vertical Block Hidden Z -Matrices And The Generalized Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/s1052623494275586openalex-snapshot
Algorithms for the Generalized Linear Complementarity Problem with a Vertical Block Z -Matrix
inferred← citeshttps://doi.org/10.1142/s0219198913400331openalex-snapshot
STEIN LINEAR PROGRAMS OVER SYMMETRIC CONES
inferred← citeshttps://doi.org/10.1145/102782.102789openalex-snapshot
Extended Horn sets in propositional logic
inferred← citeshttps://doi.org/10.1145/103418.103438openalex-snapshot
Improved algorithms for linear inequalities with two variables per inequality
inferred← citeshttps://doi.org/10.1145/3313276.3316340openalex-snapshot
A Strongly Polynomial Algorithm for Linear Exchange Markets
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-20210729-150907openalex-snapshot
Métodos de diferenças finitas para opções americanas
inferred← citeshttps://doi.org/10.1287/mnsc.26.12.1272openalex-snapshot
Note—Sensitivity Analysis in Leontief Substitution Systems
inferred← citeshttps://doi.org/10.1287/mnsc.33.1.86openalex-snapshot
The Multilocation Multiperiod Inventory Problem: Bounds and Approximations
inferred← citeshttps://doi.org/10.1287/moor.14.3.534openalex-snapshot
The Linear Order Complementarity Problem
inferred← citeshttps://doi.org/10.1287/moor.15.1.33openalex-snapshot
Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition
inferred← citeshttps://doi.org/10.1287/moor.18.2.275openalex-snapshot
Least Controls for a Class of Constrained Linear Stochastic Systems
inferred← citeshttps://doi.org/10.1287/moor.2014.0708openalex-snapshot
The Linear Complementarity Problems with a Few Variables per Constraint
inferred← citeshttps://doi.org/10.1287/moor.2020.1076openalex-snapshot
Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone
inferred← citeshttps://doi.org/10.1287/opre.29.2.215openalex-snapshot
The Multiperiod Multilocation Inventory Problem
inferred← citeshttps://doi.org/10.1287/opre.39.6.955openalex-snapshot
A Strongly Polynomial Algorithm for a Special Class of Linear Programs
inferred← citeshttps://doi.org/10.2495/rm070041openalex-snapshot
Stochastic optimization of multi-reservoir systems with power plants and spillways
inferred← citeshttps://doi.org/10.3182/20100830-3-de-4013.00027openalex-snapshot
Trajectory Tracking Control of a Timed Event Graph with Specifications Defined by a P-time Event Graph: On-line control and Off-line preparation.
inferred← citeshttps://doi.org/10.5555/320176.320223openalex-snapshot
Using separation algorithms in fixed dimension
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.