Abraham Charnes

Affiliations:
  • University of Texas at Austin, USA


According to our database1, Abraham Charnes authored at least 37 papers between 1952 and 1995.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1995
Information-theoretic approach to unimodal density estimation.
IEEE Trans. Inf. Theory, 1995

1993
Two simple applications of the unimodularity property.
Oper. Res. Lett., 1993

An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models.
Ann. Oper. Res., 1993

1991
Information Theoretic Approach to Geometric Programming.
Math. Oper. Res., 1991

1989
Stability of efficiency evaluations in data envelopment analysis.
ZOR Methods Model. Oper. Res., 1989

1988
Implementation of successive linear programming algorithms for non-convex goal programming.
Comput. Oper. Res., 1988

1986
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method.
IEEE Trans. Inf. Theory, 1986

1984
The extreme point characterization of semi-infinite dual non-Archimedean balls.
Z. Oper. Research, 1984

Sensitivity and stability analysis in dea.
Ann. Oper. Res., 1984

A developmental study of data envelopment analysis in measuring the efficiency of maintenance units in the U.S. air forces.
Ann. Oper. Res., 1984

Preface to topics in data envelopment analysis.
Ann. Oper. Res., 1984

Data envelopment analysis and regression approaches to efficiency estimation and evaluation.
Ann. Oper. Res., 1984

1980
Polyextremal principles and separably-infinite programs.
Z. Oper. Research, 1980

Separably-infinite programs.
Z. Oper. Research, 1980

Complexity and computability of solutions to linear programming systems.
Int. J. Parallel Program., 1980

1979
Page cuts for integer interval linear programming.
Discret. Appl. Math., 1979

1977
Constructive proofs of theorems relating to: <i>F(x) = y</i>, with applications.
Math. Program., 1977

Primal and dual optimality criteria in convex programming.
Math. Methods Oper. Res., 1977

An Algorithm for Solving Interval Linear Programming Problems.
Oper. Res., 1977

Technical Note - On Intersection Cuts in Interval Integer Linear Programming.
Oper. Res., 1977

Coalitional and Chance-Constrained Solutions to <i>n</i>-Person Games, II: Two-Stage Solutions.
Oper. Res., 1977

Letter to the Editor.
Oper. Res., 1977

1975
<i>V</i>-positivity, poverses and the economic global unicity theorems of Gale and Nikaido.
Z. Oper. Research, 1975

Existence and representation of diophantine and mixed diophantine solutions to linear equations and inequalities.
Discret. Math., 1975

Past, present and future of large scale transshipment computer codes and applications.
Comput. Oper. Res., 1975

1974
On Generation of Test Problems for Linear Programming Codes.
Commun. ACM, 1974

1973
Letter to the Editor - Comments on a Letter by Woolsey.
Oper. Res., 1973

1970
Letter to the Editor - A Note on a Distribution Problem.
Oper. Res., 1970

Letter to the Editor - On Stochastic Linear Approximation Problems.
Oper. Res., 1970

On the Explicit Solution of a Special Class of Linear Economic Models.
Oper. Res., 1970

1968
Chance-Constrained Games with Partially Controllable Strategies.
Oper. Res., 1968

An Explicit Solution of a Special Class of Linear Programming Problems.
Oper. Res., 1968

1966
One-Pass Algorithms for Some Generalized Network Problems.
Oper. Res., 1966

Chance-Constrained Generalized Networks.
Oper. Res., 1966

1955
Letter to the Editor - "Such Solutions are Very Little Solved".
Oper. Res., 1955

1953
Linear Programming and Profit Preference Scheduling for a Manufacturing Firm.
Oper. Res., 1953

1952
Computational problems of linear programing.
Proceedings of the 1952 ACM national meeting (Pittsburgh), 1952


  Loading...