SEARCH · Search NASA

Results for “Combinatorial optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

53 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2025

SANE: strategic autonomous non-smooth exploration for multiple optima discovery in multi-modal and non-differentiable black-box functions

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and multimodal parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, material structure image spaces, and molecular embedding spaces. Often these systems are black-boxes and time-consuming to evaluate, which resulted in strong interest towards active learning methods such as Bayesian optimization (BO). However, these systems are often noisy which make the black box function severely multi-modal and non-differentiable, where a vanilla BO can get overly focused near a single or faux optimum, deviating from the broader goal of scientific discovery. To address these limitations, here we developed Strategic Autonomous Non-Smooth Exploration (SANE) to facilitate an intelligent Bayesian optimized navigation with a proposed cost-driven probabilistic acquisition function to find multiple global and local optimal regions, avoiding the tendency to becoming trapped in a single optimum. To distinguish between a true and false optimal region due to noisy experimental measurements, a human (domain) knowledge driven dynamic surrogate gate is integrated with SANE. We implemented the gate-SANE into pre-acquired piezoresponse spectroscopy data of a ferroelectric combinatorial library with high noise levels in specific regions, and piezoresponse force microscopy (PFM) hyperspectral data. SANE demonstrated better performance than classical BO to facilitate the exploration of multiple optimal regions and thereby prioritized learning with higher coverage of scientific values in autonomous experiments. Our work showcases the potential application of this method to real-world experiments, where such combined strategic and human intervening approaches can be critical to unlocking new discoveries in autonomous research.

Biswas, Arpan [University of Tennessee, Knoxville,↗

NASA NTRS1971

Methodologies for optimal resource allocation to the national space program and new space utilizations. Volume 1: Technical description

The optimal allocation of resources to the national space program over an extended time period requires the solution of a large combinatorial problem in which the program elements are interdependent. The computer model uses an accelerated search technique to solve this problem. The model contains a large number of options selectable by the user to provide flexible input and a broad range of output for use in sensitivity analyses of all entering elements. Examples of these options are budget smoothing under varied appropriation levels, entry of inflation and discount effects, and probabilistic output which provides quantified degrees of certainty that program costs will remain within planned budget. Criteria and related analytic procedures were established for identifying potential new space program directions. Used in combination with the optimal resource allocation model, new space applications can be analyzed in realistic perspective, including the advantage gain from existing space program plant and on-going programs such as the space transportation system.

Source record↗

DOE OSTI2025

Quantum mechanical dataset of 836k neutral closed-shell molecules with up to 5 heavy atoms from C, N, O, F, Si, P, S, Cl, Br

Abstract We introduce the Vector-QM24 (VQM24) dataset comprehensively covering all possible neutral closed-shell small organic and inorganic molecules with up to five heavy (p-block) atoms: C, N, O, F, Si, P, S, Cl, Br. All valid stoichiometries, Lewis-rule-consistent graphs, and stable conformers (identified via GFN2-xTB) were enumerated combinatorially, yielding 577k conformational isomers spanning 258k constitutional isomers and 5,599 unique stoichiometries. DFT (ωB97X-D3/cc-pVDZ) optimizations were performed for all, and diffusion quantum Monte Carlo (DMC@PBE0(ccECP/cc-pVQZ)) energies are provided for 10,793 lowest-energy conformers with up to 4 heavy atoms. VQM24 includes structures, vibrational modes, rotational constants, thermodynamic properties (Gibbs free energies, enthalpies, ZPVEs, entropies, heat capacities), and electronic properties such as atomization, electron interaction, exchange-correlation, dispersion energies, multipole moments (dipole to hexadecapole), alchemical potentials, Mulliken charges, and wavefunctions. Machine learning models of atomization energies on this dataset reveal significantly higher complexity than QM9, with none achieving chemical accuracy. VQM24 offers a rigorous, high-fidelity benchmark for evaluating quantum machine learning models.

Science & Technology - Other Topics↗

NASA NTRS1980

Test vectors development and optimization for a microprocessor

This paper describes a method for generating and optimizing test vectors for a microprocessor, with the aid of a fault simulator implemented entirely by hardware. The development and optimization of test vectors has been done on a tester, with the fault simulator plugged directly into the test head. The fault simulator is capable of automatically injecting over a thousand single or multiple stuck faults in the sequential and combinatorial parts of the microprocessor. The test vectors developed by a programmer working interactively with the tester were applied through the tester to the fault simulator, and the percent of faults detected was measured. The vectors were developed and optimized for the 1802 microprocessor, with the objective of detecting 100% of the single stuck faults with a minimum set of vectors. Experimental results show that 99.7% of the single stuck faults are being detected with approximately 14,000 vectors.

Timoc, C. C.↗

DOE OSTI2025

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

DOE OSTI2024

Performance Prediction of High‐Entropy Perovskites La 0.8 Sr 0.2 Mn x Co y Fe z O 3 with Automated High‐Throughput Characterization of Combinatorial Libraries and Machine Learning

Perovskite oxides form a large family of materials with applications across various fields, owing to their structural and chemical flexibility. Efficient exploration of this extensive compositional space is now achievable through automated high-throughput experimentation combined with machine learning. In this study, we investigate the composition–structure–performance relationships of high-entropy La 0.8 Sr 0.2 Mn x Co y Fe z O 3±𝞭 perovskite oxides (0 < x, y, z <1; x+y+z≈1) for application as oxygen electrodes in Solid Oxide Cells. Following the deposition of a continuous compositional map using thin-film combinatorial pulsed laser deposition, compositional, structural, and performance properties are characterized using six different techniques with mapping capabilities. Random forests effectively model electrochemical performance, consistently identifying Fe-rich oxides as optimal compounds with the lowest area-specific resistance values for oxygen electrodes at 700 °C. Additionally, the models identify a statistical correlation between oxygen sublattice distortion—derived from spectral analysis of Raman-active modes—and enhanced performance.

high entropy oxides↗

DOE OSTI2025

Development of Multimaterial Graded Structure from Superalloys to Refractory Alloys

This research focused on developing hybrid microstructures for extreme environments where zone-specific performance is essential. Traditional structural applications rely on single alloy compositions, often requiring compromises in cost, corrosion resistance, or high-temperature stability, while dissimilar welding leads to abrupt material transitions and potential mechanical weaknesses. By employing a combinatorial approach, this study enabled a gradual transition of chemistries across components, allowing site-specific tailoring of microstructures. Leveraging additive manufacturing’s flexibility, this concept facilitated multi-material alloying and optimized fabrication strategies, unlocking new capabilities in high-performance applications while reducing manufacturing costs.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2025

Development of Multimaterial Graded Structure from Superalloys to Refractory Alloys

36 MATERIALS SCIENCE↗

DOE OSTI2026

Application of Peracetic Acid in Poultry Processing: Effects of Treatment Dynamics and Emerging Risk of Resistance Development in Salmonella spp.

Nontyphoidal Salmonella is a leading cause of foodborne illness, with poultry representing a major source. Peracetic acid (PAA), a widely adopted antimicrobial in poultry processing, offers advantages over traditional disinfectants but has sparked interest in its combined use with other antimicrobials and potential resistance. This review evaluates the efficacy of PAA in mitigating Salmonella in combination with other food-grade antimicrobials, explores possible synergism, efficacy under varying treatment parameters, resistance development against PAA, and its role in resistance evolution. While PAA demonstrates broad-spectrum efficacy, its performance varies with environmental parameters; higher temperatures generally enhance antimicrobial action but also accelerate PAA degradation. Organic matter diminishes PAA efficacy by reactive quenching. Variability in concentration and contact time further influences outcomes. Despite its oxidative mode of action and presumed low risk for resistance, emerging studies indicate that Salmonella can develop adaptive tolerance and potential cross/coresistance following repeated or sublethal exposure to PAA. These adaptations may involve genetic upregulation of oxidative stress response pathways, efflux systems, and modifications in cell membrane integrity, raising concerns about the long-term sustainability of PAA use. Additionally, combinatorial treatments (e.g., PAA with UV-C, enzymes, or organic acids) show promise in enhancing efficacy while mitigating resistance risks. Despite recognition of PAA's safety and effectiveness, knowledge gaps remain regarding standardized resistance definitions, serotype-specific tolerance, and optimal intervention strategies in commercial settings. Therefore, there is a need for standardized testing protocols, robust studies on potential resistance, and further exploration of synergistic PAA applications to ensure sustained poultry product safety and public health protection.

37 - INORGANIC, ORGANIC, PHYSICAL AND ANALYTICAL C↗

DOE OSTI2025

Biosensor-driven strain engineering reveals key cellular processes for maximizing isoprenol production in Pseudomonas putida

Synthetic biology generates vast combinatorial designs, yet high-throughput analytical methods to screen them are poorly matched to interrogate this search space. We address this challenge by developing a biosensor-driven, growth-coupled selection strategy in Pseudomonas putida for isoprenol, a potential aviation fuel precursor. We found and characterized a noncanonical signaling pathway, revealing a functional and physical complex between a hybrid histidine kinase and an alcohol dehydrogenase, whose activity is tuned by heterodimerization. Leveraging this biosensor in a pooled CRISPRi library selection, we identified key host limitations. Iterative combinatorial strain engineering derived from these hits yielded a 36-fold titer increase to ~900 milligrams per liter. Integrated omics analysis revealed that metabolic rewiring toward amino acid catabolism was crucial for this improvement. This observation was found to be beneficial by technoeconomic analysis. Our modular workflow provides a powerful strategy for optimizing complex heterologous pathways and uncovering emergent host biology.

CRISPRi↗

DOE OSTI2024

Improved Statistics for F-theory Standard Models

Much of the analysis of F-theory-based Standard Models boils down to computing cohomologies of line bundles on matter curves. By varying parameters one can degenerate such matter curves to singular ones, typically with many nodes, where the computation is combinatorial and straightforward. The question remains to relate the (a priori possibly smaller) value on the original curve to the singular one. In this work, we introduce some elementary techniques (pruning trees and removing interior edges) for simplifying the resulting nodal curves to a small collection of terminal ones that can be handled directly. When applied to the QSMs, these techniques yield optimal results in the sense that obtaining more precise answers would require currently unavailable information about the QSM geometries. This provides us with an opportunity to enhance the statistical bounds established in earlier research regarding the absence of vector-like exotics on the quark-doublet curve.

Bies, Martin↗

DOE OSTI2025

Self-Driving Microscopy for AI/ML-Enabled Physics Discovery and Materials Optimization

Materials are the bedrock of economy and foundation for all real-world technologies. The viability of space travel, grid energy storage, solar to fuels conversion, methane removal, and photovoltaic energy solutions hinge on the discovery and optimization of novel materials and rapid scaling toward manufacturing. The last 20 years have seen an exponential growth in the theoretical predictive capability for crystalline materials and small molecules. However, it is only in the last five years that we have seen the rapid expansion of high-throughput synthesis enabled by laboratory robotics and microfluidics, as well as a resurgence of combinatorial synthesis (Abolhasani and Kumacheva 2023; Epps and Abolhasani 2021; Jiang et al. 2022; Rajan 2008; Soldatov et al. 2021; Szymanski et al. 2023). Combinatorial synthesis, microfluidics, and ultimately dip-pen megalibraries have demonstrated the ability to “write” multicomponent nanomaterials at high throughput scale, generating millions of material examples in the 3D, 4D, and 5D composition spaces (Chen et al. 2016, 2019; Jibril et al. 2022).

36 MATERIALS SCIENCE↗

DOE OSTI2025

Modeling Strong Light-Matter Coupling in Correlated Systems: State-Averaged Cavity Quantum Electrodynamics Complete Active Space Self-Consistent Field Theory

The description of strongly correlated systems interacting with quantized cavity modes poses significant theoretical challenges due to the combinatorial scaling of electronic and photonic degrees of freedom. Recent advances addressing this complexity include cavity quantum electrodynamics (QED) generalizations of complete active space configuration interaction and density matrix renormalization group methods. In this work, we introduce a QED extension of state-averaged complete active space self-consistent field theory, which incorporates cavity-induced correlations through a second-order orbital optimization framework with robust convergence properties. The method is implemented using both photon number state and coherent state representations, with the latter showing robust origin invariance in the energies regardless of the completeness of the photonic Fock space. The implementation enables symmetry-free orbital relaxations to account for photon-mediated symmetry breaking in polaritonic systems. Numerical validation on lithium hydride, hydroxide anion, and magnesium hydride cation demonstrates that this method achieves significantly improved accuracy in modeling ground-state and polariton potential energy surfaces compared to QED-CASCI in a fixed orbital basis. In these studies, we reach sub-kcal/mol accuracy in potential energy surface in much smaller active spaces than are required for QED-CASCI. This advancement provides a more robust approach for studying cavity-altered chemical landscapes for ground and exited strongly coupled systems.

CASSCF↗

DOE OSTI2025

Reducing model error using optimized galaxy selection: weak lensing cluster mass estimation

Galaxy clusters are one of the most powerful probes to study extensions of General Relativity and the Standard Cosmological Model. Upcoming surveys like the Vera Rubin Observatory’s Legacy Survey of Space and Time are expected to revolutionise the field, by enabling the analysis of cluster samples of unprecedented size and quality. To reach this era of high-precision cluster cosmology, the mitigation of sources of systematic error is crucial. A particularly important challenge is bias in cluster mass measurements induced by the mismodelling of photometric redshift estimates of source galaxies. This work proposes a method to optimise the source sample selection in cluster weak lensing analyses drawn from wide-field survey lensing catalogs to reduce the bias on reconstructed cluster masses. We use a combinatorial optimisation scheme and methods from variational inference to select galaxies in latent space to produce a probabilistic galaxy source sample catalog for highly accurate cluster mass estimation. We show that our method reduces the critical surface mass density Σ crit relative modelling bias on the 60-70% level, while maintaining up to 90% of galaxies. We highlight that our methodology has applications beyond cluster mass estimation as an approach to jointly combine galaxy selection and model inference under sources of systematics.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Enhancing Electron Microscopy Image Classification Using Data Augmentation

Manual labeling for machine learning tasks such as image classification is tedious and labor-intensive; as a result, scientific datasets suitable for deep learning applications are scarce and limited. While data augmentation techniques have shown promise for extending image datasets, very little work has been done to understand the impact of combining multiple augmentation methods sequentially or the limits of their effectiveness when combined. Our work addresses this gap by examining how standard and combinatorial data augmentation affects the performance of machine learning models when trained on small datasets for label classification tasks. For our analysis, we generate single, double and quadruple-augmented datasets for a microscopy image classification task using six standard augmentation methods, and compare the resultant improvements observed in binary classification accuracy with three standard image classification models (DenseNet169, MobileNetV2, ResNet101V2). Our experiments show a non-monotonic relationship between the number of simultaneous augmentation methods and classification accuracy, indicating that there is a trade-off between the degree of augmentation and the model performance. These findings suggest that the optimal number of augmentation methods will vary by domain and use case. We also find that the order in which augmentation methods are applied to a limited dataset matters when combining augmentation schemes, with our use case showing performance differences up to 2.6% when the augmentation order is reversed for double-augmented datasets. Our work offers insights to the limits of data augmentation when working on image classification tasks with limited datasets.

Welsman, Jordan A↗

DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗