Ossama A. Saleh

Generating author description...

All published works

Action	Title	Year	Authors
+	Nordhaus–Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates	2015	Johannes H. Hattingh Ossama A. Saleh Lucas C. van der Merwe James Walters
+	Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement	2012	Johannes H. Hattingh Ossama A. Saleh Lucas C. van der Merwe James Walters
+	The elliptic matrix completion problem	2011	Ossama A. Saleh Ronald L. Smith
+	Positive proper efficient points in vector optimization	2003	Jerald P. Dauer Richard J. Gallagher Ossama A. Saleh
+	A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program	1995	Richard J. Gallagher Ossama A. Saleh
+	A Characterization of Proper Minimal Points as Solutions of Sublinear Optimization Problems	1993	Jerald P. Dauer Ossama A. Saleh
+	Two Generalizations of a Theorem of Arrow, Barankin, and Blackwell	1993	Richard J. Gallagher Ossama A. Saleh

Common Coauthors

Coauthor	Papers Together
Richard J. Gallagher	3
James Walters	2
Johannes H. Hattingh	2
Lucas C. van der Merwe	2
Jerald P. Dauer	2
Ronald L. Smith	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Positive Proper Efficient Points and Related Cone Results in Vector Optimization Theory	1990	Jerald P. Dauer Richard J. Gallagher	2
+	The geometry of Pareto efficiency over cones	1980	Jonathan M. Borwein	2
+	The induced path number of the complements of some graphs.	2005	Izak Broere Elizabeth Jonck Gayla S. Domke Lisa R. Markus	2
+	Graphical theorems of the Nordhaus-Gaddum class	1971	Gary Chartrand John Mitchem	2
+	A Generalization of a Theorem of Arrow, Barankin, and Blackwell	1988	Johannes Jahn	2
+	On Cone-Efficiency, Cone-Convexity and Cone-Compactness	1978	Roger Hartley	2
+ PDF Chat	Topological properties of the efficient point set	1972	Bezalel Peleg	2
+	An analytical comparison of different formulations of the travelling salesman problem	1991	Manfred Padberg Ting‐Yi Sung	1
+	The Euclidian Distance Matrix Completion Problem	1995	Mihály Bakonyi Charles R. Johnson	1
+	The Complexity of Vertex Enumeration Methods	1983	Martin Dyer	1
+	Finding all efficient extreme points for multiple objective linear programs	1978	J. G. Ecker I. A. Kouada	1
+	On a Theorem of Arrow, Barankin, and Blackwell	1990	Martin Petschke	1
+	The set of all nondominated solutions in linear cases and a multicriteria simplex method	1975	P. L. Yu Milan Zelený	1
+	Computational results on an algorithm for finding all vertices of a polytope	1980	T. H. Mattheiss Brian K. Schmidt	1
+	Positive definite completions of partial Hermitian matrices	1984	Robert Grone Charles R. Johnson Eduardo Marques de Sá Henry Wolkowicz	1
+	Polarities Given by Systems of Bilinear Inequalities	1983	Julián Aráoz D. Jack Edmonds Victor Griffin	1
+	Determination of the inertia of a partitioned Hermitian matrix	1968	Emilie V. Haynsworth	1
+	Elliptic matrices with zero diagonal	1994	Miroslav Fiedler	1
+	A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets	1980	T. H. Matheiss David S. Rubin	1
+ PDF Chat	Separation properties of convex cones	1955	Victor Klee	1
+	Determination of the efficient set in multiobjective linear programming	1991	Paul Armand C. Malivert	1
+	Weighting factor results in vector optimization	1988	Roland Durier	1
+	Analysis of the objective space in multiple objective linear programming	1987	Jerald P. Dauer	1
+	Generating all maximal efficient faces for multiple objective linear programs	1980	J. G. Ecker Nancy S. Hegner I. A. Kouada	1
+	The positive definite completion problem revisited	2008	Ronald L. Smith	1
+	On the Existence of Pareto Efficient Points	1983	Jonathan M. Borwein	1
+	A survey of Nordhaus–Gaddum type relations	2012	Mustapha Aouchiche Pierre Hansen	1
+	Continuity and Differentiability Properties of Convex Operators	1982	Jonathan M. Borwein	1
+	The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program	1977	Heinz Isermann	1
+	Polyhedral polarity defined by a general bilinear inequality	1982	Victor Griffin Julián Aráoz Jack Edmonds	1
+	Nonlinear Programming	1969	O. L. Mangasarian	1
+	Identifying Efficient Vectors: Some Theory and Computational Results	1980	Stanley Zionts Jyrki Wallenius	1
+	Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement	2012	Johannes H. Hattingh Ossama A. Saleh Lucas C. van der Merwe James Walters	1
+ PDF Chat	Ordered linear spaces	1970	G. J. O. Jameson	1
+	Matrix completion problems: a survey	1990	Charles R. Johnson	1
+	Nonlinear Programming.	1968	E. M. L. Beale Hans Paul Kunzi Wilhelm Krelle W. Oettli Frank Levin	1
+	Convexity and Optimization in Finite Dimensions I	1970	Josef Stoer Christoph Witzgall	1
+ PDF Chat	A Course in Functional Analysis	1985	John B. Conway	1
+	Mathematical vector optimization in partially ordered linear spaces	1986	Johannes Jahn	1
+	Ordered topological vector spaces	1967	Anthony L. Peressini	1
+	Inertia possibilities for completions of partial hermitian matrices<sup>*</sup>	1984	Charles R. Johnson Leiba Rodman	1
+	Determinantal formulae for matrix completions associated with chordal graphs	1989	Wayne Barrett Charles R. Johnson Michael Lundquist	1
+	A general method for determining the set of all efficient solutions to a linear vectormaximum problem	1977	Tomáš Gál	1
+	A revised simplex method for linear multiple objective programs	1973	James P. Evans Ralph E. Steuer	1