We formulate this problem as a nonlinear Generalized Disjunctive Program (GDP), which, following transformation, results in a large-scale mixed-integer nonlinear programming (MINLP) problem. This ...

To lighten the computational burden, the PNNL team turned to a type of algorithm known as graph coloring—a specialty of Ferdous and Halappanavar. That approach allows researchers to explore ...

Addressing this trade-off is essential for optimizing performance while ensuring numerical accuracy. In this paper, we present a genetic algorithm-based approach for tuning the precision of ...

Topics include: Run time analysis, divide-and-conquer algorithms, dynamic programming algorithms, network flow algorithms, linear and integer programming, large-scale search algorithms and heuristics, ...

CasADi is a symbolic framework for numeric optimization implementing automatic differentiation in forward and reverse modes on sparse matrix-valued computational graphs. It supports self-contained ...

Abstract: The Dynamic programming track before detect (DP-TBD) algorithm has been widely used for detection and tracking of weak targets. The selection of the merit function has an immediate influence ...

This project is a professional implementation of various data structures and algorithms in C++. Currently, the focus is on a graph data structure along with implementations of Depth-First Search (DFS) ...

Department of Chemical and Biomolecular Engineering, University of Connecticut, Storrs, Connecticut 06269, United States Center for Clean Energy Engineering, University of Connecticut, Storrs, ...