default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErick Moreno-Centeno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Christopher J. Lourenco
, Erick Moreno-Centeno:
Exact QR factorizations of rectangular matrices. Optim. Lett. 18(3): 681-695 (2024)- 2023
- [j16]W. Eric Brown, Erick Moreno-Centeno:
A data mining transmission switching heuristic for post-contingency AC power flow violation reduction in real-world, large-scale systems. Comput. Oper. Res. 160: 106391 (2023) - 2022
- [j15]Adolfo R. Escobedo, Erick Moreno-Centeno, Romena Yasmin:
An axiomatic distance methodology for aggregating multimodal evaluations. Inf. Sci. 590: 322-345 (2022) - [j14]Christopher J. Lourenco, Erick Moreno-Centeno:
Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations. SIAM J. Matrix Anal. Appl. 43(1): 439-463 (2022) - [j13]Christopher J. Lourenco, Jinhao Chen, Erick Moreno-Centeno, Timothy A. Davis:
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization. ACM Trans. Math. Softw. 48(2): 20:1-20:23 (2022) - [c3]Kisuk Sung, W. Eric Brown, Erick Moreno-Centeno, Yu Ding:
GUM: A Guided Undersampling Method to Preprocess Imbalanced Datasets for Classification. CASE 2022: 1086-1091 - 2021
- [c2]Jinhao Chen, Timothy A. Davis, Christopher J. Lourenco, Erick Moreno-Centeno:
Sparse Exact Factorization Update. IA3@SC 2021: 35-42 - [i2]Dorit S. Hochbaum, Erick Moreno-Centeno:
Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition. CoRR abs/2101.04765 (2021)
2010 – 2019
- 2019
- [j12]Christopher J. Lourenco, Adolfo R. Escobedo, Erick Moreno-Centeno, Timothy A. Davis:
Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work. SIAM J. Matrix Anal. Appl. 40(2): 609-638 (2019) - 2018
- [j11]Adolfo R. Escobedo, Erick Moreno-Centeno, Christopher J. Lourenco:
Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms: Theoretical Connections and Computational Comparisons. ACM Trans. Math. Softw. 44(4): 40:1-40:24 (2018) - 2017
- [j10]Adolfo R. Escobedo, Erick Moreno-Centeno:
Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates. SIAM J. Matrix Anal. Appl. 38(3): 829-853 (2017) - [j9]Yaping Wang, Erick Moreno-Centeno, Yu Ding:
Matching Misaligned Two-Resolution Metrology Data. IEEE Trans Autom. Sci. Eng. 14(1): 222-237 (2017) - 2016
- [j8]Ahmed M. Marzouk, Erick Moreno-Centeno, Halit Üster:
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem. INFORMS J. Comput. 28(4): 674-686 (2016) - 2015
- [j7]Adolfo R. Escobedo, Erick Moreno-Centeno:
Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations. INFORMS J. Comput. 27(4): 677-689 (2015) - 2013
- [j6]Chia-Yen Lee, Andrew L. Johnson, Erick Moreno-Centeno, Timo Kuosmanen:
A more efficient algorithm for Convex Nonparametric Least Squares. Eur. J. Oper. Res. 227(2): 391-400 (2013) - [j5]Erick Moreno-Centeno, Richard M. Karp:
The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment. Oper. Res. 61(2): 453-468 (2013) - [j4]Manish Bansal, Kiavash Kianfar, Yu Ding, Erick Moreno-Centeno:
Hybridization of Bound-and-Decompose and Mixed Integer Feasibility Checking to Measure Redundancy in Structured Linear Systems. IEEE Trans Autom. Sci. Eng. 10(4): 1151-1157 (2013) - 2011
- [j3]Dorit S. Hochbaum, Erick Moreno-Centeno, Phillip Yelland, Rodolfo A. Catena:
Rating Customers According to Their Promptness to Adopt New Products. Oper. Res. 59(5): 1171-1183 (2011) - [c1]Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala:
Algorithms for Implicit Hitting Set Problems. SODA 2011: 614-629 - [i1]Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala:
Algorithms for Implicit Hitting Set Problems. CoRR abs/1102.1472 (2011) - 2010
- [b1]Erick Moreno-Centeno:
Use and analysis of new optimization techniques for decision theory and data mining. University of California, Berkeley, USA, 2010
2000 – 2009
- 2008
- [j2]Dorit S. Hochbaum, Erick Moreno-Centeno:
Country credit-risk rating aggregation via the separation-deviation model. Optim. Methods Softw. 23(5): 741-762 (2008) - [j1]Dorit S. Hochbaum, Erick Moreno-Centeno:
The inequality-satisfiability problem. Oper. Res. Lett. 36(2): 229-233 (2008)
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 2025-01-09 13:24 CET 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:
