Daniel Bienstock
Daniel Bienstock
Liu Family Professor of Operations Research, Columbia University
Verified email at columbia.edu - Homepage
Title
Cited by
Cited by
Year
Computational study of a family of mixed-integer quadratic programming problems
D Bienstock
Mathematical programming 74 (2), 121-140, 1996
4321996
Chance-constrained optimal power flow: Risk-aware network control under uncertainty
D Bienstock, M Chertkov, S Harnett
Siam Review 56 (3), 461-495, 2014
3982014
Monotonicity in graph searching
D Bienstock, P Seymour
Journal of Algorithms 12 (2), 239-245, 1991
3081991
A note on the prize collecting traveling salesman problem
D Bienstock, MX Goemans, D Simchi-Levi, D Williamson
Mathematical programming 59 (1), 413-420, 1993
3011993
Capacitated network design—polyhedral structure and computation
D Bienstock, O Günlük
Informs journal on Computing 8 (3), 243-259, 1996
2871996
Minimum cost capacity installation for multicommodity network flows
D Bienstock, S Chopra, O Günlük, CY Tsai
Mathematical programming 81 (2), 177-199, 1998
2771998
The Problem in Power Grids: New Models, Formulations, and Numerical Experiments
D Bienstock, A Verma
SIAM Journal on Optimization 20 (5), 2352-2380, 2010
1862010
Graph searching, path-width, tree-width and related problems (a survey)
D Bienstock
DIMACS Ser. in Discrete Mathematics and Theoretical Computer Science 5, 33-49, 1991
1841991
Power grid vulnerability to geographically correlated failures—Analysis and control implications
A Bernstein, D Bienstock, D Hay, M Uzunoglu, G Zussman
IEEE INFOCOM 2014-IEEE Conference on Computer Communications, 2634-2642, 2014
1822014
Computing robust basestock levels
D Bienstock, N Özbay
Discrete Optimization 5 (2), 389-414, 2008
1622008
Potential function methods for approximately solving linear programming problems: theory and practice
D Bienstock
Springer Science & Business Media, 2002
1492002
On the complexity of testing for odd holes and induced odd paths
D Bienstock
Discrete Mathematics 90 (1), 85-92, 1991
1431991
Computational experience with a difficult mixedinteger multicommodity flow problem
D Bienstock, O Günlük
Mathematical Programming 68 (1), 213-237, 1995
1261995
Quickly excluding a forest
D Bienstock, N Robertson, P Seymour, R Thomas
Journal of Combinatorial Theory (Ser. B) 52, 274-283, 1991
1261991
Using mixed-integer programming to solve power grid blackout problems
D Bienstock, S Mattia
Discrete Optimization 4 (1), 115-141, 2007
1212007
Optimizing resource acquisition decisions by stochastic programming
D Bienstock, JF Shapiro
Management Science 34 (2), 215-229, 1988
1191988
Solving LP relaxations of large-scale precedence constrained problems
D Bienstock, M Zuckerberg
International Conference on Integer Programming and Combinatorial …, 2010
1142010
Some provably hard crossing number problems
D Bienstock
Discrete & Computational Geometry 6 (3), 443-459, 1991
1121991
On the structure of minimum-weight k-connected spanning networks
D Bienstock, EF Brickell, CL Monma
SIAM Journal on Discrete Mathematics 3 (3), 320-329, 1990
1031990
Bounds for rectilinear crossing numbers
D Bienstock, N Dean
Journal of Graph Theory 17 (3), 333-348, 1993
1011993
The system can't perform the operation now. Try again later.
Articles 1–20