| Publication | Date of Publication | Type |
|---|
Cardinality minimization, constraints, and regularization: a survey
SIAM Review | 2024-08-09 | Paper |
| Accurate Linear Cutting-Plane Relaxations for ACOPF | 2023-12-07 | Paper |
| Incentivizing Investment and Reliability: A Study on Electricity Capacity Markets | 2023-11-10 | Paper |
Principled deep neural network training through linear programming
Discrete Optimization | 2023-09-28 | Paper |
On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level
Journal of Optimization Theory and Applications | 2023-07-26 | Paper |
Complexity, exactness, and rationality in polynomial optimization
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Computational study of a family of mixed-integer quadratic programming problems
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Mathematical programming formulations for the alternating current optimal power flow problem
Annals of Operations Research | 2022-08-01 | Paper |
On inequalities with bounded coefficients and pitch for the min knapsack polytope
Discrete Optimization | 2022-06-09 | Paper |
Complexity, exactness, and rationality in polynomial optimization
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Pitch, extension complexity, and covering problems
Operations Research Letters | 2021-12-13 | Paper |
Mathematical programming formulations for the alternating current optimal power flow problem
4OR | 2021-05-11 | Paper |
Stochastic Defense Against Complex Grid Attacks
IEEE Transactions on Control of Network Systems | 2020-10-05 | Paper |
Outer-product-free sets for polynomial optimization and oracle-based cuts
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Strong NP-hardness of AC power flows feasibility
Operations Research Letters | 2020-02-10 | Paper |
| Intersection cuts for polynomial optimization | 2020-02-06 | Paper |
Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty
IEEE Transactions on Control of Network Systems | 2020-01-28 | Paper |
Variance-Aware Optimal Power Flow: Addressing the Tradeoff Between Cost, Security, and Variability
IEEE Transactions on Control of Network Systems | 2020-01-28 | Paper |
Polynomial Solvability of Variants of the Trust-Region Subproblem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Stochastic defense against complex grid attacks
(available as arXiv preprint) | 2018-07-17 | Paper |
| Simpler derivation of bounded pitch inequalities for set covering, and minimum knapsack sets | 2018-06-19 | Paper |
LP formulations for polynomial optimization problems
SIAM Journal on Optimization | 2018-04-24 | Paper |
| Variance-Aware Optimal Power Flow | 2017-11-02 | Paper |
| Robust linear control of nonconvex battery operation in transmission systems | 2016-10-28 | Paper |
A note on polynomial solvability of the CDT problem
SIAM Journal on Optimization | 2016-03-02 | Paper |
| Electrical transmission system cascades and vulnerability. An operations research viewpoint | 2016-02-04 | Paper |
| Models for managing the impact of an epidemic | 2015-07-30 | Paper |
| Two-sided linear chance constraints and extensions | 2015-07-07 | Paper |
| Robust Control of Cascading Power Grid Failures using Stochastic Approximation | 2015-04-03 | Paper |
| Vulnerability Analysis of Power Systems | 2015-03-08 | Paper |
Chance-constrained optimal power flow: risk-aware network control under uncertainty
SIAM Review | 2014-11-24 | Paper |
| On linear relaxations of OPF problems | 2014-11-04 | Paper |
Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
SIAM Journal on Optimization | 2014-09-26 | Paper |
Tightening simple mixed-integer sets with guaranteed bounds
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
The \(N-k\) problem in power grids: new models, formulations, and numerical experiments
SIAM Journal on Optimization | 2011-03-21 | Paper |
| Optimal adaptive control of cascading power grid failures | 2010-12-17 | Paper |
Solving LP relaxations of large-scale precedence constrained problems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Eigenvalue techniques for convex objective, nonconvex optimization problems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation
Operations Research | 2009-08-13 | Paper |
Computing robust basestock levels
Discrete Optimization | 2008-10-29 | Paper |
Approximate formulations for 0-1 knapsack sets
Operations Research Letters | 2008-09-10 | Paper |
Using mixed-integer programming to solve power grid blackout problems
Discrete Optimization | 2008-02-22 | Paper |
Approximate fixed-rank closures of covering problems
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Tree-width and the Sherali-Adams operator
Discrete Optimization | 2005-08-22 | Paper |
Subset Algebra Lift Operators for 0-1 Integer Programming
SIAM Journal on Optimization | 2005-02-23 | Paper |
Strong inequalities for capacitated survivable network design problems.
Mathematical Programming. Series A. Series B | 2004-02-18 | Paper |
Potential function methods for approximately solving linear programming problems: theory and practice.
International Series in Operations Research & Management Science | 2004-02-08 | Paper |
ATM network design: Traffic models and optimization-based heuristics
Telecommunication Systems | 2003-02-17 | Paper |
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1445278 (Why is no real title available?) | 2001-02-08 | Paper |
Minimum cost capacity installation for multicommodity network flows
Mathematical Programming. Series A. Series B | 1999-10-18 | Paper |
Capacitated Network Design—Polyhedral Structure and Computation
INFORMS Journal on Computing | 1997-01-15 | Paper |
Computational study of a family of mixed-integer quadratic programming problems
Mathematical Programming. Series A. Series B | 1996-10-31 | Paper |
Computational experience with a difficult mixed-integer multicommodity flow problem
Mathematical Programming. Series A. Series B | 1996-04-18 | Paper |
| scientific article; zbMATH DE number 795221 (Why is no real title available?) | 1995-09-11 | Paper |
A degree sequence problem related to network design
Networks | 1994-08-29 | Paper |
A note on the prize collecting traveling salesman problem
Mathematical Programming. Series A. Series B | 1994-08-16 | Paper |
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
Mathematics of Operations Research | 1994-04-12 | Paper |
Blocking Small Cuts in a Network, and Related Problems
SIAM Journal on Computing | 1993-09-01 | Paper |
Bounds for rectilinear crossing numbers
Journal of Graph Theory | 1993-08-24 | Paper |
A Lot-Sizing Problem on Trees, Related to Network Design
Mathematics of Operations Research | 1993-08-05 | Paper |
| scientific article; zbMATH DE number 176249 (Why is no real title available?) | 1993-05-18 | Paper |
On obstructions to small face covers in planar graphs
Journal of Combinatorial Theory. Series B | 1993-03-10 | Paper |
New results on rectilinear crossing numbers and plane embeddings
Journal of Graph Theory | 1993-01-17 | Paper |
Corrigendum to: On the complexity of testing for odd holes and induced odd paths
Discrete Mathematics | 1992-09-27 | Paper |
Polynomially solvable special cases of the Steiner problem in planar networks
Annals of Operations Research | 1992-06-27 | Paper |
A Note on Finding a Strict Saddlepoint
The American Mathematical Monthly | 1992-06-27 | Paper |
Quickly excluding a forest
Journal of Combinatorial Theory. Series B | 1992-06-26 | Paper |
Monotonicity in graph searching
Journal of Algorithms | 1992-06-25 | Paper |
Some Generalized Max-Flow Min-Cut Problems in the Plane
Mathematics of Operations Research | 1992-06-25 | Paper |
An Extremal Problem on Sparse 0-1 Matrices
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
Some provably hard crossing number problems
Discrete & Computational Geometry | 1992-06-25 | Paper |
On the complexity of testing for odd holes and induced odd paths
Discrete Mathematics | 1992-06-25 | Paper |
On the complexity of embedding planar graphs to minimize certain distance measures
Algorithmica | 1990-01-01 | Paper |
On embedding graphs in trees
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
On the Structure of Minimum-Weight k-Connected Spanning Networks
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
On a Network Design Problem That Is Intractable on Trees
Mathematics of Operations Research | 1990-01-01 | Paper |
Linear-Time Test for Small Face Covers in any Fixed Surface
SIAM Journal on Computing | 1990-01-01 | Paper |
Optimal enclosing regions in planar graphs
Networks | 1989-01-01 | Paper |
On the Complexity of Covering Vertices by Faces in a Planar Graph
SIAM Journal on Computing | 1988-01-01 | Paper |
Average distance in graphs with removed elements
Journal of Graph Theory | 1988-01-01 | Paper |
Asymptotic Analysis of Some Network Reliability Models
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Broadcasting with random faults
Discrete Applied Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4099323 (Why is no real title available?) | 1988-01-01 | Paper |
Some Lattice-Theoretic Tools for Network Reliability Analysis
Mathematics of Operations Research | 1988-01-01 | Paper |
An algorithm for reliability analysis of planar graphs
Networks | 1986-01-01 | Paper |
Risk-Aware Security-Constrained Unit Commitment: Taming the Curse of Real-Time Volatility and Consumer Exposure
(available as arXiv preprint) | N/A | Paper |
Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
(available as arXiv preprint) | N/A | Paper |
