default search action
James Ostrowski
Person information
- affiliation: University of Tennessee, Department of Industrial and Systems Engineering, Knoxville, TN, USA
- affiliation (former): Argonne National Laboratory, IL, USA
- affiliation (former): Lehigh University, Department of Industrial and Systems Engineering, Bethlehem, PA, USA
- affiliation (former): University of Waterloo, Department of Management Sciences, ON, Canada
Other persons with the same name
- James P. Ostrowski (aka: Jim Ostrowski 0001) — Evolution Robotics, Pasadena, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Najmaddin Akhundov
, James Ostrowski
Exploiting symmetry for the job sequencing and tool switching problem. Eur. J. Oper. Res. 316(3): 976-987 (2024) - [c7]Samuel Bringman, Anthony Wilkie, Rebekah Herrman, James Ostrowski:
Mathematical Model for SWAP Gate Minimization on NISQ Hardware. ISVLSI 2024: 640-643 - [i4]Anthony Wilkie, Igor Gaidai, James Ostrowski, Rebekah Herrman:
QAOA with random and subgraph phase operators. CoRR abs/2402.18412 (2024) - 2023
- [j22]Devanshu Agrawal, James Ostrowski:
Densely Connected G-invariant Deep Neural Networks with Signed Permutation Representations. J. Mach. Learn. Res. 24: 370:1-370:40 (2023) - [j21]Rizwanul Alam, George Siopsis
Solving MaxCut with quantum imaginary time evolution. Quantum Inf. Process. 22(7): 281 (2023) - [i3]Devanshu Agrawal, James Ostrowski:
Densely Connected G-invariant Deep Neural Networks with Signed Permutation Representations. CoRR abs/2303.04614 (2023) - 2022
- [j20]Bernard Knueven, James Ostrowski, Anya Castillo, Jean-Paul Watson:
A computationally efficient algorithm for computing convex hull prices. Comput. Ind. Eng. 163: 107806 (2022) - [c6]Devanshu Agrawal, James Ostrowski:
A Classification of $G$-invariant Shallow Neural Networks. NeurIPS 2022 - [i2]Devanshu Agrawal, James Ostrowski:
A Classification of G-invariant Shallow Neural Networks. CoRR abs/2205.09219 (2022) - 2021
- [j19]Rebekah Herrman
Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems. Algorithms 14(10): 294 (2021) - [j18]Jeff T. Linderoth
Orbital Conflict: Cutting Planes for Symmetric Integer Programs. INFORMS J. Optim. 3(2): 139-153 (2021) - [j17]Rebekah Herrman
Lower bounds on circuit depth of the quantum approximate optimization algorithm. Quantum Inf. Process. 20(2): 59 (2021) - [j16]Rebekah Herrman
Impact of graph structures for QAOA on MaxCut. Quantum Inf. Process. 20(8): 289 (2021) - [j15]Phillip C. Lotshaw
Empirical performance bounds for quantum approximate optimization. Quantum Inf. Process. 20(12): 403 (2021) - 2020
- [j14]Amelia McIlvenna, Andrew Herron
Reducing the computational burden of a microgrid energy management system. Comput. Ind. Eng. 143: 106384 (2020) - [j13]Bernard Knueven
On Mixed-Integer Programming Formulations for the Unit Commitment Problem. INFORMS J. Comput. 32(4): 857-876 (2020) - [j12]Amelia McIlvenna, James Ostrowski
Practice Summary: Improved Reliability via Optimization in Residential Microgrids. INFORMS J. Appl. Anal. 50(2): 112-118 (2020) - [j11]Bernard Knueven, James Ostrowski
A novel matching formulation for startup costs in unit commitment. Math. Program. Comput. 12(2): 225-248 (2020) - [i1]James Ostrowski
Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm. CoRR abs/2008.01820 (2020)
2010 – 2019
- 2019
- [j10]Mohammad Ramshani, Jim Ostrowski
Two level uncapacitated facility location problem with disruptions. Comput. Ind. Eng. 137 (2019) - [j9]Masoud Barah
Decomposing the Train-Scheduling Problem into Integer-Optimal Polytopes. Transp. Sci. 53(3): 763-772 (2019) - 2018
- [j8]Ben Knueven
The Ramping Polytope and Cut Generation for the Unit Commitment Problem. INFORMS J. Comput. 30(4): 739-749 (2018) - [j7]Ben Knueven, Jim Ostrowski
Detecting almost symmetries of graphs. Math. Program. Comput. 10(2): 143-185 (2018) - 2015
- [j6]James Ostrowski
Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1): 99-129 (2015) - 2014
- [j5]Leo Liberti, James Ostrowski
Stabilizer-based symmetry breaking constraints for mathematical programs. J. Glob. Optim. 60(2): 183-194 (2014) - [j4]James Ostrowski
Using symmetry to optimize over the Sherali-Adams relaxation. Math. Program. Comput. 6(4): 405-428 (2014) - 2012
- [j3]James Ostrowski
Network reduction in the Transmission-Constrained Unit Commitment problem. Comput. Ind. Eng. 63(3): 702-707 (2012) - [c5]James Ostrowski
Using Symmetry to Optimize Over the Sherali-Adams Relaxation. ISCO 2012: 59-70 - [c4]Mustafa A. Biviji, W. Maria Wang, James Ostrowski, Jianhui Wang:
Price elasticity of electricity demand for various dynamic rate programs. ISGT 2012: 1 - 2011
- [j2]James Ostrowski
Orbital branching. Math. Program. 126(1): 147-178 (2011) - [j1]James Ostrowski
Solving large Steiner Triple Covering Problems. Oper. Res. Lett. 39(2): 127-131 (2011) - 2010
- [c3]James Ostrowski
Tight mixed integer linear programming formulations for generator Self-Scheduling. CCECE 2010: 1-4
2000 – 2009
- 2008
- [c2]James Ostrowski
Constraint Orbital Branching. IPCO 2008: 225-239 - 2007
- [c1]James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi
Orbital Branching. IPCO 2007: 104-118
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: