Bounding separable recourse functions with limited distribution information. - John R. Birge; José H. Dulá (Ann. Oper. Res., 1991)

Preprocessing Schemes and a Solution Method for the Convex Hull Problem in Multidimensional Space. - José H. Dulá; Richard V. Helgason; Betty L. Hickman (Computer Science and Operations Research, 1992)

A Tchebysheff-Type Bound on the Expectation of Sublinear Polyhedral Functions. - José H. Dulá; Rajluxmi V. Murthy (Oper. Res., 1992)

An upper bound on the expectation of simplicial functions of multivariate random variables. - José H. Dulá (Math. Program., 1992)

Designing a majorization scheme for the recourse function in two-stage stochastic linear programming. - José H. Dulá (Comput. Optim. Appl., 1993)

An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull. - José H. Dulá; Richard V. Helgason; N. Venugopal (INFORMS J. Comput., 1998)

Fast algorithms for frames and point depth. - José H. Dulá (Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, 2003)

Point Sets and Frame Algorithms in Management. - José H. Dulá (AAIM, 2005)

Nonparametric frontier analysis with multiple constituencies. - Marie-Laure Bougnol; José H. Dulá; Donna L. Retzlaff-Roberts; Norman Keith Womer (J. Oper. Res. Soc., 2005)

Validating DEA as a ranking tool: An application of DEA to assess performance in higher education. - Marie-Laure Bougnol; José H. Dulá (Ann. Oper. Res., 2006)

Benefit-cost analysis using data envelopment analysis. - Norman Keith Womer; Marie-Laure Bougnol; José H. Dulá; Donna L. Retzlaff-Roberts (Ann. Oper. Res., 2006)

Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron. - José H. Dulá; Francisco J. López (INFORMS J. Comput., 2006)

A computational study of DEA with massive data sets. - José H. Dulá (Comput. Oper. Res., 2008)

Adding and removing an attribute in a DEA model: theory and processing. - Francisco J. López; José H. Dulá (J. Oper. Res. Soc., 2008)

Preprocessing DEA. - José H. Dulá; Francisco J. López (Comput. Oper. Res., 2009)

Anchor points in DEA. - Marie-Laure Bougnol; José H. Dulá (Eur. J. Oper. Res., 2009)

A geometrical approach for generalizing the production possibility set in DEA. - José H. Dulá (J. Oper. Res. Soc., 2009)

An Algorithm for Data Envelopment Analysis. - José H. Dulá (INFORMS J. Comput., 2011)

Competing output-sensitive frame algorithms. - José H. Dulá; Francisco J. López (Comput. Geom., 2012)

Interior point methods in DEA to determine non-zero multiplier weights. - Marie-Laure Bougnol; José H. Dulá; Paul Rouse (Comput. Oper. Res., 2012)

The L1-norm best-fit hyperplane problem. - J. Paul Brooks; José H. Dulá (Appl. Math. Lett., 2013)

A pure L1L1-norm principal component analysis. - J. Paul Brooks; José H. Dulá; Edward L. Boone (Comput. Stat. Data Anal., 2013)

A mathematical model to optimize decisions to impact multi-attribute rankings. - Marie-Laure Bougnol; José H. Dulá (Scientometrics, 2013)

The other side of ranking schemes: generating weights for specified outcomes. - Marie-Laure Bougnol; José H. Dulá (Int. Trans. Oper. Res., 2016)

Improving productivity using government data: The case of US Centers for Medicare & Medicaid's 'Nursing Home Compare'. - Marie-Laure Bougnol; José H. Dulá (J. Oper. Res. Soc., 2021)

Competing DEA procedures: analysis, testing, and comparisons. - Gregory Koronakos; José H. Dulá; Dimitris K. Despotis (CoRR, 2024)

The recommender problem with convex hulls. - Marie-Laure Bougnol; José H. Dulá (INFOR Inf. Syst. Oper. Res., 2024)