Competing output-sensitive frame algorithms

Ali, 1993, Streamlined computation for data envelopment analysis, European Journal of Operational Research, 64, 61, 10.1016/0377-2217(93)90008-B Barnett, 1976, The ordering of multivariate data, Journal of the Royal Statistical Society, Series A, 139, 318, 10.2307/2344839 Barr, 1997, Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models, Annals of Operations Research, 73, 339, 10.1023/A:1018941531019 Berger, 1993, Bank efficiency derived from the profit function, Journal of Banking and Finance, 17, 317, 10.1016/0378-4266(93)90035-C CGAL User and Reference Manual, http://www.cgal.org/, 2007. Chan, 1996, Output-sensitive results on convex hulls, extreme points, and related problems, Discrete & Computational Geometry, 16, 369, 10.1007/BF02712874 K.L. Clarkson, More output-sensitive geometric algorithms, in: Proc. 35th IEEE Sympos. Found. Comput. Sci., 1994, pp. 695–702. Dantzig, 1963 Dulá, 1994, Geometry of optimal value functions with applications to redundancy in linear programming, Journal of Optimization Theory and Applications, 81, 35, 10.1007/BF02190312 Dulá, 1996, A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space, European Journal of Operational Research, 92, 352, 10.1016/0377-2217(94)00366-1 Dulá, 2001, A computational framework for accelerating DEA, Journal of Productivity Analysis, 16, 63, 10.1023/A:1011103303616 Dulá, 2006, Algorithms for the frame of a finitely generated unbounded polyhedron, INFORMS Journal on Computing, 18, 97, 10.1287/ijoc.1040.0109 Dulá, 2008, A computational study with DEA with massive data sets, Computers and Operations Research, 35, 1191, 10.1016/j.cor.2006.07.011 Dulá, 2009, Preprocessing DEA, Computers and Operations Research, 36, 1204, 10.1016/j.cor.2008.01.004 Dulá, 2011, An algorithm for data envelopment analysis, INFORMS Journal on Computing, 23, 284, 10.1287/ijoc.1100.0400 Edelsbrunner, 1987, Algorithms in Combinatorial Geometry, vol. 10 Federal Financial Institutions Examination Council (FFIEC), Report of Condition and Income, http://www.chicagofed.org/economic_research_and_data/weekly_report_of_assets_and_liabilities.cfm, 2004. Gass, 1958 Gerstenhaber, 1951, Theory of convex polyhedral cones, 298 ILOG S.A., ILOG CPLEX Division, 889 Alder Avenue, Incline Village, Nevada, 2007. IMSL Numerical Libraries, Visual Numerics, Inc., 2500 Wilcrest Drive, Suite 200, Houston, TX 77042. Korhonen, 2007, Using lexicographic parametric programming for identifying efficient units in DEA, Computers and Operations Research, 34, 2177, 10.1016/j.cor.2005.08.006 Korhonen, 2009, A dimensional decomposition approach to identifying efficient units in large-scale DEA models, Computers and Operations Research, 36, 234, 10.1016/j.cor.2007.09.010 López, 2005, Generating random points (or vectors) while controlling the percentage of them that are extreme in their convex (or positive) hull, Journal of Mathematical Modelling and Algorithms, 4, 219, 10.1007/s10852-005-1597-z López, 2008, Adding and removing an attribute in a DEA model: theory and processing, Journal of the Operational Research Society, 59, 1674, 10.1057/palgrave.jors.2602505 Ottmann, 1995, Enumerating extreme points in higher dimension, vol. 900 Ottmann, 2001, Enumerating extreme points in higher dimension, Nordic Journal of Computing, 8, 179 Sueyoshi, 1990, A special algorithm for an additive model in data envelopment analysis, Journal of the Operational Research Society, 3, 249, 10.1057/jors.1990.41 Wallace, 1992, Preprocessing in stochastic programming: the case of linear programs, ORSA Journal on Computing, 4, 45, 10.1287/ijoc.4.1.45