James Ostrowski

Orcid: 0000-0001-5636-555X

Affiliations:
  • University of Tennessee, Department of Industrial and Systems Engineering, Knoxville, TN, USA
  • Argonne National Laboratory, IL, USA (former)
  • Lehigh University, Department of Industrial and Systems Engineering, Bethlehem, PA, USA (former)
  • University of Waterloo, Department of Management Sciences, ON, Canada (former)


According to our database1, James Ostrowski authored at least 27 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
QAOA with random and subgraph phase operators.
CoRR, 2024

2023
Solving MaxCut with quantum imaginary time evolution.
Quantum Inf. Process., July, 2023

Densely Connected G-invariant Deep Neural Networks with Signed Permutation Representations.
CoRR, 2023

2022
A computationally efficient algorithm for computing convex hull prices.
Comput. Ind. Eng., 2022

A Classification of $G$-invariant Shallow Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Orbital Conflict: Cutting Planes for Symmetric Integer Programs.
INFORMS J. Optim., January, 2021

Empirical performance bounds for quantum approximate optimization.
Quantum Inf. Process., 2021

Impact of graph structures for QAOA on MaxCut.
Quantum Inf. Process., 2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm.
Quantum Inf. Process., 2021

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems.
Algorithms, 2021

2020
A novel matching formulation for startup costs in unit commitment.
Math. Program. Comput., 2020

Practice Summary: Improved Reliability via Optimization in Residential Microgrids.
INFORMS J. Appl. Anal., 2020

On Mixed-Integer Programming Formulations for the Unit Commitment Problem.
INFORMS J. Comput., 2020

Reducing the computational burden of a microgrid energy management system.
Comput. Ind. Eng., 2020

2019
Decomposing the Train-Scheduling Problem into Integer-Optimal Polytopes.
Transp. Sci., 2019

Two level uncapacitated facility location problem with disruptions.
Comput. Ind. Eng., 2019

2018
Detecting almost symmetries of graphs.
Math. Program. Comput., 2018

The Ramping Polytope and Cut Generation for the Unit Commitment Problem.
INFORMS J. Comput., 2018

2015
Modified orbital branching for structured symmetry with an application to unit commitment.
Math. Program., 2015

2014
Using symmetry to optimize over the Sherali-Adams relaxation.
Math. Program. Comput., 2014

Stabilizer-based symmetry breaking constraints for mathematical programs.
J. Glob. Optim., 2014

2012
Network reduction in the Transmission-Constrained Unit Commitment problem.
Comput. Ind. Eng., 2012

Price elasticity of electricity demand for various dynamic rate programs.
Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2012

2011
Solving large Steiner Triple Covering Problems.
Oper. Res. Lett., 2011

Orbital branching.
Math. Program., 2011

2010
Tight mixed integer linear programming formulations for generator Self-Scheduling.
Proceedings of the 23rd Canadian Conference on Electrical and Computer Engineering, 2010

2008
Constraint Orbital Branching.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008


  Loading...