James Ostrowski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
James Ostrowski has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
- George Siopsis
The University of Tennessee
8 shared publications - Rebekah Herrman
Department of Industrial and Systems Engineering, University of Tennessee Knoxville, Knoxville, USA
6 shared publications - Fabrizio Rossi
DISIM University of L'Aquila Coppito (AQ) 67100 Italy
5 shared publications Jianhui Wang
Decision and Information Sciences Division, Argonne National Laboratory, Argonne, United States
5 shared publications- Phillip C. Lotshaw
Oak Ridge National Laboratory
5 shared publications - Stefano Smriglio
DISIM University of L'Aquila Coppito (AQ) 67100 Italy
5 shared publications
Latest Publications
- 1 October 2026
- Published by Taylor & Francis in Nuclear Technology
- p. 1-27
An Integer Programming Method for Maintenance Schedule Optimization in Nuclear Power Plants
- 1 October 2026
- Published by Taylor & Francis in Nuclear Technology
- p. 1-27
An Integer Programming Method for Maintenance Schedule Optimization in Nuclear Power Plants
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 106730-106737
Evaluating State-of-Charge Constraints for Pumped Storage Hydropower in ISO-Scale Unit Commitment
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 106730-106737
Open AccessEvaluating State-of-Charge Constraints for Pumped Storage Hydropower in ISO-Scale Unit Commitment
- Open Access
Learning Feasible Quantum States for Quadratic Constrained Binary Optimization Problems
Quantum computing approaches excel at solving quadratic unconstrained binary optimization (QUBO) problems, however solving quadratic constrained binary optimization problems (QCBOs) is more challenging. In this work, we develop a variational approach that creates an equal superposition of quantum states that satisfy constraints in a QCBO. The method relies on flag qubits, one per constraint, to identify when a constraint is violated or not. The resulting equal superposition can be used as an initial state for quantum algorithms that solve QUBOs/QCBOs such as Grover's search algorithm or the quantum approximate optimization algorithm (QAOA). We test the approach on sets of one and two linear inequality constraints and find that it is able to generate an equal superposition of feasible states with a .98 AR on average. We then use the approach to generate initial states for Grover-mixer QAOA (GM-QAOA) and find that GM-QAOA with the constraint gadgets yields significantly higher probability of measuring the optimal solution than random guessing.
Open AccessLearning Feasible Quantum States for Quadratic Constrained Binary Optimization Problems
Quantum computing approaches excel at solving quadratic unconstrained binary optimization (QUBO) problems, however solving quadratic constrained binary optimization problems (QCBOs) is more challenging. In this work, we develop a variational approach that creates an equal superposition of quantum states that satisfy constraints in a QCBO. The method relies on flag qubits, one per constraint, to identify when a constraint is violated or not. The resulting equal superposition can be used as an initial state for quantum algorithms that solve QUBOs/QCBOs such as Grover's search algorithm or the quantum approximate optimization algorithm (QAOA). We test the approach on sets of one and two linear inequality constraints and find that it is able to generate an equal superposition of feasible states with a .98 AR on average. We then use the approach to generate initial states for Grover-mixer QAOA (GM-QAOA) and find that GM-QAOA with the constraint gadgets yields significantly higher probability of measuring the optimal solution than random guessing.
- Top Cited Papers
- 18 February 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (2) , 1-22
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
- 18 February 2025
- Published by Springer Nature in Quantum Information Processing
- Vol. 24 (2) , 1-22
Top Cited PapersGraph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
- 24 June 2024
- Published by Elsevier in Electric Power Systems Research
- Vol. 234
Near-optimal solutions for day-ahead unit commitment
- 24 June 2024
- Published by Elsevier in Electric Power Systems Research
- Vol. 234
Near-optimal solutions for day-ahead unit commitment
- 21 May 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (5) , 052430
Combinatorial optimization with quantum imaginary time evolution
We use quantum imaginary-time evolution (QITE) to solve polynomial unconstrained binary optimization (PUBO) problems. We show that a linear ansatz yields good results for a wide range of PUBO problems, often outperforming standard classical methods, such as the Goemans-Williamson (GW) algorithm. We obtain numerical results for the low-autocorrelation binary sequences (LABS) and weighted MaxCut combinatorial optimization problems, thus extending an earlier demonstration of successful application of QITE on MaxCut for unweighted graphs. We find the performance of QITE on the LABS problem with a separable ansatz comparable to QAOA at level 10 for up to 18 vertices and do not see a significant advantage with an entangling ansatz. On weighted MaxCut, QITE with a separable ansatz often outperforms the GW algorithm on graphs with up to 150 vertices.
- 21 May 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (5) , 052430
Combinatorial optimization with quantum imaginary time evolution
We use quantum imaginary-time evolution (QITE) to solve polynomial unconstrained binary optimization (PUBO) problems. We show that a linear ansatz yields good results for a wide range of PUBO problems, often outperforming standard classical methods, such as the Goemans-Williamson (GW) algorithm. We obtain numerical results for the low-autocorrelation binary sequences (LABS) and weighted MaxCut combinatorial optimization problems, thus extending an earlier demonstration of successful application of QITE on MaxCut for unweighted graphs. We find the performance of QITE on the LABS problem with a separable ansatz comparable to QAOA at level 10 for up to 18 vertices and do not see a significant advantage with an entangling ansatz. On weighted MaxCut, QITE with a separable ansatz often outperforms the GW algorithm on graphs with up to 150 vertices.
- 1 March 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (3) , 976-987
Exploiting symmetry for the job sequencing and tool switching problem
- 1 March 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (3) , 976-987
Exploiting symmetry for the job sequencing and tool switching problem
- Open Access
Combinatorial optimization with quantum imaginary time evolution
We use Quantum Imaginary Time Evolution (QITE) to solve polynomial unconstrained binary optimization (PUBO) problems. We show that a linear Ansatz yields good results for a wide range of PUBO problems, often outperforming standard classical methods, such as the Goemans-Williamson (GW) algorithm. We obtain numerical results for the Low Autocorrelation Binary Sequences (LABS) and weighted MaxCut combinatorial optimization problems, thus extending an earlier demonstration of successful application of QITE on MaxCut for unweighted graphs. We find the performance of QITE on the LABS problem with a separable Ansatz comparable with p=10 QAOA, and do not see a significant advantage with an entangling Ansatz. On weighted MaxCut, QITE with a separable Ansatz often outperforms the GW algorithm on graphs up to 150 vertices.
Open AccessCombinatorial optimization with quantum imaginary time evolution
We use Quantum Imaginary Time Evolution (QITE) to solve polynomial unconstrained binary optimization (PUBO) problems. We show that a linear Ansatz yields good results for a wide range of PUBO problems, often outperforming standard classical methods, such as the Goemans-Williamson (GW) algorithm. We obtain numerical results for the Low Autocorrelation Binary Sequences (LABS) and weighted MaxCut combinatorial optimization problems, thus extending an earlier demonstration of successful application of QITE on MaxCut for unweighted graphs. We find the performance of QITE on the LABS problem with a separable Ansatz comparable with p=10 QAOA, and do not see a significant advantage with an entangling Ansatz. On weighted MaxCut, QITE with a separable Ansatz often outperforms the GW algorithm on graphs up to 150 vertices.
- Open Access
Densely Connected $G$-invariant Deep Neural Networks with Signed Permutation Representations
We introduce and investigate, for finite groups $G$, $G$-invariant deep neural network ($G$-DNN) architectures with ReLU activation that are densely connected-- i.e., include all possible skip connections. In contrast to other $G$-invariant architectures in the literature, the preactivations of the$G$-DNNs presented here are able to transform by \emph{signed} permutation representations (signed perm-reps) of $G$. Moreover, the individual layers of the $G$-DNNs are not required to be $G$-equivariant; instead, the preactivations are constrained to be $G$-equivariant functions of the network input in a way that couples weights across all layers. The result is a richer family of $G$-invariant architectures never seen previously. We derive an efficient implementation of $G$-DNNs after a reparameterization of weights, as well as necessary and sufficient conditions for an architecture to be ``admissible''-- i.e., nondegenerate and inequivalent to smaller architectures. We include code that allows a user to build a $G$-DNN interactively layer-by-layer, with the final architecture guaranteed to be admissible. We show that there are far more admissible $G$-DNN architectures than those accessible with the ``concatenated ReLU'' activation function from the literature. Finally, we apply $G$-DNNs to two example problems -- (1) multiplication in $\{-1, 1\}$ (with theoretical guarantees) and (2) 3D object classification -- % finding that the inclusion of signed perm-reps significantly boosts predictive performance compared to baselines with only ordinary (i.e., unsigned) perm-reps.Open AccessDensely Connected $G$-invariant Deep Neural Networks with Signed Permutation Representations
We introduce and investigate, for finite groups $G$, $G$-invariant deep neural network ($G$-DNN) architectures with ReLU activation that are densely connected-- i.e., include all possible skip connections. In contrast to other $G$-invariant architectures in the literature, the preactivations of the$G$-DNNs presented here are able to transform by \emph{signed} permutation representations (signed perm-reps) of $G$. Moreover, the individual layers of the $G$-DNNs are not required to be $G$-equivariant; instead, the preactivations are constrained to be $G$-equivariant functions of the network input in a way that couples weights across all layers. The result is a richer family of $G$-invariant architectures never seen previously. We derive an efficient implementation of $G$-DNNs after a reparameterization of weights, as well as necessary and sufficient conditions for an architecture to be ``admissible''-- i.e., nondegenerate and inequivalent to smaller architectures. We include code that allows a user to build a $G$-DNN interactively layer-by-layer, with the final architecture guaranteed to be admissible. We show that there are far more admissible $G$-DNN architectures than those accessible with the ``concatenated ReLU'' activation function from the literature. Finally, we apply $G$-DNNs to two example problems -- (1) multiplication in $\{-1, 1\}$ (with theoretical guarantees) and (2) 3D object classification -- % finding that the inclusion of signed perm-reps significantly boosts predictive performance compared to baselines with only ordinary (i.e., unsigned) perm-reps. - 14 September 2023
- Published by Springer Nature in Energy Systems
- Vol. 16 (2) , 797-818
Convex hull pricing as a risk mitigation device in unit commitment
- 14 September 2023
- Published by Springer Nature in Energy Systems
- Vol. 16 (2) , 797-818
Convex hull pricing as a risk mitigation device in unit commitment