David E. Bernal
Orcid: 0000-0002-8308-5016Affiliations:
- Universities Space Research Association (USRA), Research Institute for Advanced Computer Science (RIACS), Moffett Federal Airfield, CA, USA
- Carnegie Mellon University, Department of Chemical Engineering, Pittsburgh, PA, USA (former, PhD)
- NASA Ames Research Center, Quantum AI Lab (QuAIL), Moffett Field, CA, USA (former)
According to our database1,
David E. Bernal
authored at least 29 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on linkedin.com
-
on twitter.com
-
on orcid.org
On csauthors.net:
Bibliography
2024
Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones.
Comput. Optim. Appl., May, 2024
SIAM J. Optim., 2024
Mach. Learn. Sci. Technol., 2024
Future Gener. Comput. Syst., 2024
Federated Learning with Quantum Computing and Fully Homomorphic Encryption: A Novel Computing Paradigm Shift in Privacy-Preserving ML.
CoRR, 2024
Federated Hierarchical Tensor Networks: a Collaborative Learning Quantum AI-Driven Framework for Healthcare.
CoRR, 2024
Classical and Quantum Distributed Algorithms for the Survivable Network Design Problem.
CoRR, 2024
Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications.
CoRR, 2024
Measure this, not that: Optimizing the cost and model-based information content of measurements.
Comput. Chem. Eng., 2024
Utilizing modern computer architectures to solve mathematical optimization problems: A survey.
Comput. Chem. Eng., 2024
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024
2023
Mind the O˜: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms.
Algorithms, July, 2023
Asymptotically Faster Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees.
CoRR, 2023
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023
Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023
2022
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem.
Quantum Inf. Process., 2022
J. Glob. Optim., 2022
CoRR, 2022
2021
Hybrid model generation for superstructure optimization with Generalized Disjunctive Programming.
Comput. Chem. Eng., 2021
2020
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump.
Optim. Methods Softw., 2020
Using regularization and second order information in outer approximation for convex MINLP.
Math. Program., 2020
Integration of crude-oil scheduling and refinery planning by Lagrangean Decomposition.
Comput. Chem. Eng., 2020
Optimal design of superstructures for placing units and streams with multiple and ordered available locations. Part II: Rigorous design of catalytic distillation columns.
Comput. Chem. Eng., 2020
Optimal design of superstructures for placing units and streams with multiple and ordered available locations. Part I: A new mathematical framework.
Comput. Chem. Eng., 2020
Comput. Chem. Eng., 2020
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020
2019
Global optimization algorithm for multi-period design and planning of centralized and distributed manufacturing networks.
Comput. Chem. Eng., 2019
A center-cut algorithm for quickly obtaining feasible solutions and solving convex MINLP problems.
Comput. Chem. Eng., 2019
2018
Comput. Chem. Eng., 2018