• Publications
  • Influence
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
When uncontrollable resources fluctuate, optimal power flow (OPF), routinely used by the electric power industry to redispatch hourly controllable generation (coal, gas, and hydro plants) overExpand
  • 334
  • 46
Computational study of a family of mixed-integer quadratic programming problems
  • D. Bienstock
  • Mathematics, Computer Science
  • Math. Program.
  • 31 August 1996
We present computational experience with a branch-and-cut algorithm to solve quadratic programming problems where there is an upper bound on the number of positive variables. Such problems arise inExpand
  • 240
  • 39
Monotonicity in Graph Searching
Abstract We give a new proof of the result, due to A. LaPaugh, that a graph may be optimally “searched” without clearing any edge twice.
  • 243
  • 32
Capacitated Network Design - Polyhedral Structure and Computation
We study a capacity expansion problem that arises in telecommunication network design. Given a capacitated network and a traffic demand matrix, the objective is to add capacity to the edges, inExpand
  • 229
  • 29
Minimum cost capacity installation for multicommodity network flows
Consider a directed graphG = (V,A), and a set of traffic demands to be shipped between pairs of nodes inV. Capacity has to be installed on the edges of this graph (in integer multiples of a baseExpand
  • 213
  • 18
On the complexity of testing for odd holes and induced odd paths
  • D. Bienstock
  • Mathematics, Computer Science
  • Discret. Math.
  • 1 June 1991
Abstract The following problems, of possible interest with regards to perfect graphs, are shown to be NP-Complete. 1. (1) Does a graph contain an induced odd cycle of length greater than three,Expand
  • 105
  • 18
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decomposition that scaleExpand
  • 112
  • 17
A note on the prize collecting traveling salesman problem
We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum ofExpand
  • 227
  • 15
Computational Study of a Family of Mixed-Integer Quadratic Programming Problems
We present computational experience with a branch-and-cut algorithm to solve quadratic programming problems where there is an upper bound on the number of positive variables. Such problems arise inExpand
  • 113
  • 14
Quickly excluding a forest
Abstract We prove that for every forest F , every graph with no minor isomorphic to F has path-width at most | V ( F )| −2.
  • 95
  • 14