Publication | Date of Publication | Type |
---|
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 | 2023-09-28 | Paper |
On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level | 2023-07-26 | Paper |
Complexity, exactness, and rationality in polynomial optimization | 2023-03-14 | Paper |
Computational study of a family of mixed-integer quadratic programming problems | 2022-08-30 | Paper |
Mathematical programming formulations for the alternating current optimal power flow problem | 2022-08-01 | Paper |
On inequalities with bounded coefficients and pitch for the min knapsack polytope | 2022-06-09 | Paper |
Complexity, exactness, and rationality in polynomial optimization | 2021-12-21 | Paper |
Pitch, extension complexity, and covering problems | 2021-12-13 | Paper |
Mathematical programming formulations for the alternating current optimal power flow problem | 2021-05-11 | Paper |
Stochastic Defense Against Complex Grid Attacks | 2020-10-05 | Paper |
Outer-product-free sets for polynomial optimization and oracle-based cuts | 2020-08-28 | Paper |
Strong NP-hardness of AC power flows feasibility | 2020-02-10 | Paper |
Intersection cuts for polynomial optimization | 2020-02-06 | Paper |
Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty | 2020-01-28 | Paper |
Variance-Aware Optimal Power Flow: Addressing the Tradeoff Between Cost, Security, and Variability | 2020-01-28 | Paper |
Polynomial Solvability of Variants of the Trust-Region Subproblem | 2019-06-20 | Paper |
Stochastic defense against complex grid attacks | 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 | 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 | 2016-03-02 | Paper |
Electrical Transmission System Cascades and Vulnerability | 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 | 2014-11-24 | Paper |
On linear relaxations of OPF problems | 2014-11-04 | Paper |
Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets | 2014-09-26 | Paper |
Tightening simple mixed-integer sets with guaranteed bounds | 2012-06-26 | Paper |
The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments | 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 | 2010-06-22 | Paper |
Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems | 2010-06-22 | Paper |
Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation | 2009-08-13 | Paper |
Computing robust basestock levels | 2008-10-29 | Paper |
Approximate formulations for 0-1 knapsack sets | 2008-09-10 | Paper |
Using mixed-integer programming to solve power grid blackout problems | 2008-02-22 | Paper |
Approximate fixed-rank closures of covering problems | 2006-01-13 | Paper |
Tree-width and the Sherali-Adams operator | 2005-08-22 | Paper |
Subset Algebra Lift Operators for 0-1 Integer Programming | 2005-02-23 | Paper |
Strong inequalities for capacitated survivable network design problems. | 2004-02-18 | Paper |
Potential function methods for approximately solving linear programming problems: theory and practice. | 2004-02-08 | Paper |
ATM network design: Traffic models and optimization-based heuristics | 2003-02-17 | Paper |
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem | 2002-12-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4952591 | 2001-02-08 | Paper |
Minimum cost capacity installation for multicommodity network flows | 1999-10-18 | Paper |
Capacitated Network Design—Polyhedral Structure and Computation | 1997-01-15 | Paper |
Computational study of a family of mixed-integer quadratic programming problems | 1996-10-31 | Paper |
Computational experience with a difficult mixed-integer multicommodity flow problem | 1996-04-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4845370 | 1995-09-11 | Paper |
A degree sequence problem related to network design | 1994-08-29 | Paper |
A note on the prize collecting traveling salesman problem | 1994-08-16 | Paper |
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands | 1994-04-12 | Paper |
Blocking Small Cuts in a Network, and Related Problems | 1993-09-01 | Paper |
Bounds for rectilinear crossing numbers | 1993-08-24 | Paper |
A Lot-Sizing Problem on Trees, Related to Network Design | 1993-08-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4035355 | 1993-05-18 | Paper |
On obstructions to small face covers in planar graphs | 1993-03-10 | Paper |
New results on rectilinear crossing numbers and plane embeddings | 1993-01-17 | Paper |
Corrigendum to: On the complexity of testing for odd holes and induced odd paths | 1992-09-27 | Paper |
Polynomially solvable special cases of the Steiner problem in planar networks | 1992-06-27 | Paper |
A Note on Finding a Strict Saddlepoint | 1992-06-27 | Paper |
Quickly excluding a forest | 1992-06-26 | Paper |
On the complexity of testing for odd holes and induced odd paths | 1992-06-25 | Paper |
Some provably hard crossing number problems | 1992-06-25 | Paper |
An Extremal Problem on Sparse 0-1 Matrices | 1992-06-25 | Paper |
Monotonicity in graph searching | 1992-06-25 | Paper |
Some Generalized Max-Flow Min-Cut Problems in the Plane | 1992-06-25 | Paper |
On the complexity of embedding planar graphs to minimize certain distance measures | 1990-01-01 | Paper |
On embedding graphs in trees | 1990-01-01 | Paper |
On a Network Design Problem That Is Intractable on Trees | 1990-01-01 | Paper |
On the Structure of Minimum-Weight k-Connected Spanning Networks | 1990-01-01 | Paper |
Linear-Time Test for Small Face Covers in any Fixed Surface | 1990-01-01 | Paper |
Optimal enclosing regions in planar graphs | 1989-01-01 | Paper |
Broadcasting with random faults | 1988-01-01 | Paper |
Average distance in graphs with removed elements | 1988-01-01 | Paper |
Asymptotic Analysis of Some Network Reliability Models | 1988-01-01 | Paper |
On the Complexity of Covering Vertices by Faces in a Planar Graph | 1988-01-01 | Paper |
Some Lattice-Theoretic Tools for Network Reliability Analysis | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3824325 | 1988-01-01 | Paper |
An algorithm for reliability analysis of planar graphs | 1986-01-01 | Paper |