2013 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
The scientist’s investigation covers issues in Mathematical optimization, Integer programming, Combinatorics, Graph and Power grid. Mathematical optimization and Network control are commonly linked in his work. His research in Integer programming intersects with topics in Multi-commodity flow problem, Flow network, Computation, Scale and Upper and lower bounds.
His work in Computation tackles topics such as Network planning and design which are related to areas like Telecommunications network. His Upper and lower bounds research includes themes of Branch and cut, Quadratic programming, Criss-cross algorithm and Knapsack problem. He has researched Graph in several fields, including Characterization, Minor, Isomorphism and Treewidth.
His primary scientific interests are in Mathematical optimization, Combinatorics, Discrete mathematics, Integer programming and Optimization problem. In his works, Daniel Bienstock undertakes multidisciplinary study on Mathematical optimization and Stochastic process. His Combinatorics study combines topics from a wide range of disciplines, such as Bounded function and Knapsack problem.
His work in the fields of Knapsack problem, such as Continuous knapsack problem, overlaps with other areas such as Covering problems. His Discrete mathematics research includes elements of Polynomial optimization and Relaxation. Daniel Bienstock works in the field of Integer programming, focusing on Branch and cut in particular.
His main research concerns Mathematical optimization, Discrete mathematics, Linear programming, Polynomial optimization and Stochastic process. Mathematical optimization is closely attributed to Theory of computation in his study. Daniel Bienstock interconnects Graph and Linear programming relaxation in the investigation of issues within Discrete mathematics.
The concepts of his Linear programming study are interwoven with issues in Complex number, Flow and Nonlinear system. His Polynomial optimization research is multidisciplinary, incorporating elements of Treewidth, Polynomial inequalities and Dimension. His Computation study incorporates themes from Control system and Robustness.
Daniel Bienstock mainly investigates Mathematical optimization, Stochastic process, Discrete mathematics, Linear programming and Topology. His study on Mathematical optimization is mostly dedicated to connecting different topics, such as Control. Variance, Work, Control system and Computation are fields of study that intersect with his Stochastic process study.
His work in the fields of Treewidth overlaps with other areas such as Class. He has included themes like Time complexity, Deep learning, Artificial intelligence, Exponential function and Polynomial in his Linear programming study. Topology is intertwined with AC power, Flow system and Materials science in his study.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Computational study of a family of mixed-integer quadratic programming problems
Daniel Bienstock.
Mathematical Programming (1996)
Computational study of a family of mixed-integer quadratic programming problems
Daniel Bienstock.
Mathematical Programming (1996)
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty ∗
Daniel Bienstock;Michael Chertkov;Sean Harnett.
Siam Review (2014)
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty ∗
Daniel Bienstock;Michael Chertkov;Sean Harnett.
Siam Review (2014)
A note on the prize collecting traveling salesman problem
Daniel Bienstock;Michel X. Goemans;David Simchi-Levi;David Williamson.
Mathematical Programming (1993)
A note on the prize collecting traveling salesman problem
Daniel Bienstock;Michel X. Goemans;David Simchi-Levi;David Williamson.
Mathematical Programming (1993)
Monotonicity in graph searching
D. Bienstock;Paul Seymour.
Journal of Algorithms (1991)
Monotonicity in graph searching
D. Bienstock;Paul Seymour.
Journal of Algorithms (1991)
Capacitated Network Design—Polyhedral Structure and Computation
Daniel Bienstock;Oktay Günlük.
Informs Journal on Computing (1996)
Capacitated Network Design—Polyhedral Structure and Computation
Daniel Bienstock;Oktay Günlük.
Informs Journal on Computing (1996)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Arizona
Los Alamos National Laboratory
Columbia University
Los Alamos National Laboratory
Georgia Institute of Technology
University of Tennessee at Knoxville
Princeton University
University of Wisconsin–Madison
Rutherford Appleton Laboratory
Hong Kong University of Science and Technology
Kumamoto University
Boston University
University of Copenhagen
Osaka University
Sorbonne University
State University of New York
University of Padua
University of Toronto
University of Nebraska–Lincoln
Chinese University of Hong Kong
Fudan University
University of Cologne
University of Melbourne
Temple University
Duke University