Adolfo R. Escobedo

Orcid: 0000-0002-4843-3564

According to our database1, Adolfo R. Escobedo authored at least 22 papers between 2015 and 2026.

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

2026
Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation.
CoRR, February, 2026

Heuristic Methods for Top-k List Aggregation Under the Generalized Kendall Tau Distance.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2026

2024
Exact Matrix Factorization Updates for Nonlinear Programming.
INFORMS J. Comput., 2024

2023
Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures.
J. Comb. Optim., September, 2023

Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems.
Comput. Oper. Res., May, 2023

Assessing the Effects of Expanded Input Elicitation and Machine Learning-Based Priming on Crowd Stock Prediction.
Proceedings of the Advances in Computational Collective Intelligence, 2023

2022
An axiomatic distance methodology for aggregating multimodal evaluations.
Inf. Sci., 2022

Improving Crowdsourcing-Based Image Classification Through Expanded Input Elicitation and Machine Learning.
Frontiers Artif. Intell., 2022

Operations research in optimal power flow: A guide to recent and emerging methodologies and applications.
Eur. J. Oper. Res., 2022

Fast and Exact Matrix Factorization Updates for Nonlinear Programming.
CoRR, 2022

Derivation and generation of path-based valid inequalities for transmission expansion planning.
Ann. Oper. Res., 2022

Top-k List Aggregation: Mathematical Formulations and Polyhedral Comparisons.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021
A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation.
Decis. Anal., 2021

Lower Bounds on Kemeny Rank Aggregation with Non-Strict Rankings.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2021

Enhancing Image Classification Capabilities of Crowdsourcing-Based Methods through Expanded Input Elicitation.
Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, 2021

2020
A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings.
Eur. J. Oper. Res., 2020

A Comparison of Axiomatic Distance-Based Collective Intelligence Methods for Wireless Sensor Network State Estimation in the Presence of Information Injection.
Proceedings of the 6th IEEE World Forum on Internet of Things, 2020

Enhancing Collective Estimates by Aggregating Cardinal and Ordinal Inputs.
Proceedings of the Eighth AAAI Conference on Human Computation and Crowdsourcing, 2020

2019
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., 2019

2018
Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms: Theoretical Connections and Computational Comparisons.
ACM Trans. Math. Softw., 2018

2017
Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates.
SIAM J. Matrix Anal. Appl., 2017

2015
Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations.
INFORMS J. Comput., 2015


  Loading...