Steven A. Gabriel

Affiliations:
  • University of Maryland, College Park, MD, USA


According to our database1, Steven A. Gabriel authored at least 29 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Regularized Equilibrium Problems with Equilibrium Constraints with Application to Energy Markets.
SIAM J. Optim., September, 2023

Uncovering Strategies and Commitment Through Machine Learning System Introspection.
SN Comput. Sci., July, 2023

Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: Application to water resource systems.
Comput. Oper. Res., June, 2023

2022
On linear bilevel optimization problems with complementarity-constrained lower levels.
J. Oper. Res. Soc., 2022

A New Computational Approach for Solving Linear Bilevel Programs Based on Parameter-Free Disjunctive Decomposition.
CoRR, 2022

Using inverse optimization to learn cost functions in generalized Nash games.
Comput. Oper. Res., 2022

2021
Solving binary-constrained mixed complementarity problems using continuous reformulations.
Comput. Oper. Res., 2021

2020
Discretely constrained mixed complementary problems: Application and analysis of a stylised electricity market.
J. Oper. Res. Soc., 2020

A parametric programming approach to bilevel optimisation with lower-level variables in the upper level.
J. Oper. Res. Soc., 2020

2019
Applications of logic constrained equilibria to traffic networks and to power systems with storage.
J. Oper. Res. Soc., 2019

An RLT approach for solving the binary-constrained mixed linear complementarity problem.
Comput. Oper. Res., 2019

2016
A rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: Application to natural gas markets.
Comput. Oper. Res., 2016

2015
Solving mixed-integer robust optimization problems with interval uncertainty using Benders decomposition.
J. Oper. Res. Soc., 2015

2013
Solving discretely constrained, mixed linear complementarity problems with applications in energy.
Comput. Oper. Res., 2013

A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints.
Ann. Oper. Res., 2013

2012
An Integer Programming Approach for Evaluating R&D Funding Decisions With Optimal Budget Allocations.
IEEE Trans. Engineering Management, 2012

2010
A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints.
J. Oper. Res. Soc., 2010

2009
Solving stochastic complementarity problems in energy market modeling using scenario reduction.
Eur. J. Oper. Res., 2009

2008
A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies.
J. Oper. Res. Soc., 2008

2007
A multiobjective optimization model for processing and distributing biosolids to reuse fields.
J. Oper. Res. Soc., 2007

2006
A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables.
J. Oper. Res. Soc., 2006

Electricity market near-equilibrium under locational marginal pricing and minimum profit conditions.
Eur. J. Oper. Res., 2006

2005
A Mixed Complementarity-Based Equilibrium Model of Natural Gas Markets.
Oper. Res., 2005

2001
The National Energy Modeling System: A Large-Scale Energy-Economic Equilibrium Model.
Oper. Res., 2001

2000
Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models.
Comput. Math. Organ. Theory, 2000

1998
A Hybrid Smoothing Method for Mixed Nonlinear Complementarity Problems.
Comput. Optim. Appl., 1998

1997
The Traffic Equilibrium Problem with Nonadditive Path Costs.
Transp. Sci., 1997

1993
NE/SQP: A robust algorithm for the nonlinear complementarity problem.
Math. Program., 1993

1992
An inexact NE/SQP method for solving the nonlinear complementarity problem.
Comput. Optim. Appl., 1992


  Loading...