default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé H. Dulá
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Marie-Laure Bougnol
, José H. Dulá:
The recommender problem with convex hulls. INFOR Inf. Syst. Oper. Res. 62(2): 259-272 (2024)- [i1]Gregory Koronakos, José H. Dulá, Dimitris K. Despotis:
Competing DEA procedures: analysis, testing, and comparisons. CoRR abs/2407.15585 (2024) - 2021
- [j22]Marie-Laure Bougnol, José H. Dulá:
Improving productivity using government data: The case of US Centers for Medicare & Medicaid's 'Nursing Home Compare'. J. Oper. Res. Soc. 72(5): 1075-1086 (2021)
2010 – 2019
- 2016
- [j21]Marie-Laure Bougnol, José H. Dulá:
The other side of ranking schemes: generating weights for specified outcomes. Int. Trans. Oper. Res. 23(4): 655-668 (2016) - 2013
- [j20]J. Paul Brooks, José H. Dulá:
The L1-norm best-fit hyperplane problem. Appl. Math. Lett. 26(1): 51-55 (2013) - [j19]J. Paul Brooks, José H. Dulá, Edward L. Boone:
A pure L1L1-norm principal component analysis. Comput. Stat. Data Anal. 61: 83-98 (2013) - [j18]Marie-Laure Bougnol, José H. Dulá:
A mathematical model to optimize decisions to impact multi-attribute rankings. Scientometrics 95(2): 785-796 (2013) - 2012
- [j17]José H. Dulá, Francisco J. López:
Competing output-sensitive frame algorithms. Comput. Geom. 45(4): 186-197 (2012) - [j16]Marie-Laure Bougnol, José H. Dulá, Paul Rouse:
Interior point methods in DEA to determine non-zero multiplier weights. Comput. Oper. Res. 39(3): 698-708 (2012) - 2011
- [j15]José H. Dulá:
An Algorithm for Data Envelopment Analysis. INFORMS J. Comput. 23(2): 284-296 (2011)
2000 – 2009
- 2009
- [j14]José H. Dulá, Francisco J. López:
Preprocessing DEA. Comput. Oper. Res. 36(4): 1204-1220 (2009) - [j13]Marie-Laure Bougnol, José H. Dulá:
Anchor points in DEA. Eur. J. Oper. Res. 192(2): 668-676 (2009) - [j12]José H. Dulá:
A geometrical approach for generalizing the production possibility set in DEA. J. Oper. Res. Soc. 60(11): 1546-1555 (2009) - 2008
- [j11]José H. Dulá:
A computational study of DEA with massive data sets. Comput. Oper. Res. 35(4): 1191-1203 (2008) - [j10]Francisco J. López, José H. Dulá:
Adding and removing an attribute in a DEA model: theory and processing. J. Oper. Res. Soc. 59(12): 1674-1684 (2008) - 2006
- [j9]Norman Keith Womer, Marie-Laure Bougnol, José H. Dulá, Donna L. Retzlaff-Roberts:
Benefit-cost analysis using data envelopment analysis. Ann. Oper. Res. 145(1): 229-250 (2006) - [j8]Marie-Laure Bougnol, José H. Dulá:
Validating DEA as a ranking tool: An application of DEA to assess performance in higher education. Ann. Oper. Res. 145(1): 339-365 (2006) - [j7]José H. Dulá, Francisco J. López:
Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron. INFORMS J. Comput. 18(1): 97-110 (2006) - 2005
- [j6]Marie-Laure Bougnol, José H. Dulá, Donna L. Retzlaff-Roberts, Norman Keith Womer:
Nonparametric frontier analysis with multiple constituencies. J. Oper. Res. Soc. 56(3): 252-266 (2005) - [c2]José H. Dulá:
Point Sets and Frame Algorithms in Management. AAIM 2005: 450-459 - 2003
- [c1]José H. Dulá:
Fast algorithms for frames and point depth. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications 2003: 211-221
1990 – 1999
- 1998
- [j5]José H. Dulá, Richard V. Helgason, N. Venugopal:
An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull. INFORMS J. Comput. 10(3): 323-330 (1998) - 1993
- [j4]José H. Dulá:
Designing a majorization scheme for the recourse function in two-stage stochastic linear programming. Comput. Optim. Appl. 1(4): 399-414 (1993) - 1992
- [j3]José H. Dulá, Rajluxmi V. Murthy:
A Tchebysheff-Type Bound on the Expectation of Sublinear Polyhedral Functions. Oper. Res. 40(5): 914-922 (1992) - [j2]José H. Dulá:
An upper bound on the expectation of simplicial functions of multivariate random variables. Math. Program. 55: 69-80 (1992) - [p1]José H. Dulá, Richard V. Helgason, Betty L. Hickman:
Preprocessing Schemes and a Solution Method for the Convex Hull Problem in Multidimensional Space. Computer Science and Operations Research 1992: 59-70 - 1991
- [j1]John R. Birge, José H. Dulá:
Bounding separable recourse functions with limited distribution information. Ann. Oper. Res. 30(1): 277-298 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
