Daniel Bienstock

Daniel Bienstock, Benjamin McClosky: Tightening simple mixed-integer sets with guaranteed bounds. Math. Program. 133(1-2): 337-363 (2012)

Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman: Sensitivity analysis of the power grid vulnerability to large-scale cascading failures. SIGMETRICS Performance Evaluation Review 40(3): 33-37 (2012)

Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman: Power Grid Vulnerability to Geographically Correlated Failures - Analysis and Control Implications. CoRR abs/1206.1099 (2012)

Daniel Bienstock, Michael Chertkov, Sean Harnett: Chance Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty. CoRR abs/1209.5779 (2012)

Daniel Bienstock: Optimal control of cascading power grid failures. CDC-ECE 2011: 2166-2173

Daniel Bienstock, Abhinav Verma: The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments. SIAM Journal on Optimization 20(5): 2352-2380 (2010)

Daniel Bienstock, Mark Zuckerberg: Solving LP Relaxations of Large-Scale Precedence Constrained Problems. IPCO 2010: 1-14

Daniel Bienstock: Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. IPCO 2010: 29-42

Daniel Bienstock, Nuri Özbay: Computing robust basestock levels. Discrete Optimization 5(2): 389-414 (2008)

Daniel Bienstock: Approximate formulations for 0-1 knapsack sets. Oper. Res. Lett. 36(3): 317-320 (2008)

Daniel Bienstock, Sara Mattia: Using mixed-integer programming to solve power grid blackout problems. Discrete Optimization 4(1): 115-141 (2007)

Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee: Foreword. Annals OR 146(1): 1-2 (2006)

Daniel Bienstock, Olga Raskina, Iraj Saniee, Qiong Wang: Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation. Operations Research 54(2): 261-276 (2006)

Daniel Bienstock, Mark Zuckerberg: Approximate fixed-rank closures of covering problems. Math. Program. 105(1): 9-27 (2006)

Daniel Bienstock, Garud Iyengar: Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations. SIAM J. Comput. 35(4): 825-854 (2006)

Daniel Bienstock, Nuri Özbay: Tree-width and the Sherali-Adams operator. Discrete Optimization 1(1): 13-21 (2004)

Daniel Bienstock, Mark Zuckerberg: Subset Algebra Lift Operators for 0-1 Integer Programming. SIAM Journal on Optimization 15(1): 63-95 (2004)

Daniel Bienstock, Garud Iyengar: Solving fractional packing problems in O^ast(1/?) iterations. STOC 2004: 146-155

George L. Nemhauser, Daniel Bienstock (Eds.): Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings. Lecture Notes in Computer Science 3064, Springer 2004, isbn 3-540-22113-1

Daniel Bienstock, Iraj Saniee: ATM Network Design: Traffic Models and Optimization-Based Heuristics. Telecommunication Systems 16(3-4): 399-421 (2001)

Daniel Bienstock: epsilon-Approximate linear programs: new bounds and computation. SODA 2000: 1-2

Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81: 177-199 (1998)

Daniel Bienstock, Oktay Günlük: Capacitated Network Design - Polyhedral Structure and Computation. INFORMS Journal on Computing 8(3): 243-259 (1996)

Daniel Bienstock: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74: 121-140 (1996)

Daniel Bienstock, Oktay Günlük: Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. 68: 213-237 (1995)

Daniel Bienstock: Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. IPCO 1995: 80-94

Daniel Bienstock, Oktay Günlük: A degree sequence problem related to network design. Networks 24(4): 195-205 (1994)

Daniel Bienstock, Nathaniel Dean: Bounds for rectilinear crossing numbers. Journal of Graph Theory 17(3): 333-348 (1993)

Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson: A note on the prize collecting traveling salesman problem. Math. Program. 59: 413-420 (1993)

Daniel Bienstock, Nicole Diaz: Blocking Small Cuts in a Network, and Related Problems. SIAM J. Comput. 22(3): 482-499 (1993)

Daniel Bienstock: Computational experience with an effective heuristic for some capacity expansion problems in local access networks. Telecommunication Systems 1(1): 379-400 (1993)

Daniel Bienstock, Nathaniel Dean: On obstructions to small face covers in planar graphs. J. Comb. Theory, Ser. B 55(2): 163-189 (1992)

Daniel Bienstock, Nathaniel Dean: New results on rectilinear crossing numbers and plane embeddings. Journal of Graph Theory 16(5): 389-398 (1992)

Daniel Bienstock: A Lot-Sizing Problem on Trees, Related to Network Design. IPCO 1992: 421-434

Daniel Bienstock: Some Provably Hard Crossing Number Problems. Discrete & Computational Geometry 6: 443-459 (1991)

Daniel Bienstock: On the complexity of testing for odd holes and induced odd paths. Discrete Mathematics 90(1): 85-92 (1991)

Daniel Bienstock, Paul D. Seymour: Monotonicity in Graph Searching. J. Algorithms 12(2): 239-245 (1991)

Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly excluding a forest. J. Comb. Theory, Ser. B 52(2): 274-283 (1991)

Daniel Bienstock, Ervin Györi: An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discrete Math. 4(1): 17-27 (1991)

Daniel Bienstock, Clyde L. Monma: On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. Algorithmica 5(1): 93-109 (1990)

Daniel Bienstock: On embedding graphs in trees. J. Comb. Theory, Ser. B 49(1): 103-136 (1990)

Daniel Bienstock: Linear-Time Test for Small Face Covers in Any Fixed Surface. SIAM J. Comput. 19(5): 907-911 (1990)

Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma: On the Structure of Minimum-Weight k-Connected Spanning Networks. SIAM J. Discrete Math. 3(3): 320-329 (1990)

Daniel Bienstock: Some Provably Hard Crossing Number Problems. Symposium on Computational Geometry 1990: 253-260

Daniel Bienstock: Some Provably Hard Crossing Number Problems. IPCO 1990: 61-83

Daniel Bienstock, Clyde L. Monma: Optimal enclosing regions in planar graphs. Networks 19(1): 79-94 (1989)

Daniel Bienstock: Broadcasting with random faults. Discrete Applied Mathematics 20(1): 1-7 (1988)

Daniel Bienstock, Ervin Györi: Average distance in graphs with removed elements. Journal of Graph Theory 12(3): 375-390 (1988)

Daniel Bienstock, Clyde L. Monma: On the Complexity of Covering Vertices by Faces in a Planar Graph. SIAM J. Comput. 17(1): 53-76 (1988)

Daniel Bienstock: Asymptotic Analysis of some Network Reliability Models. SIAM J. Discrete Math. 1(1): 14-21 (1988)