default search action
Daniel Bienstock
Dan Bienstock
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j69]Andreas M. Tillmann
, Daniel Bienstock
Cardinality Minimization, Constraints, and Regularization: A Survey. SIAM Rev. 66(3): 403-477 (2024) - 2023
- [j68]Daniel Bienstock, Gonzalo Muñoz
Principled deep neural network training through linear programming. Discret. Optim. 49: 100795 (2023) - [j67]Yasmine Beck
On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level. J. Optim. Theory Appl. 198(1): 428-447 (2023) - [j66]Daniel Bienstock, Alberto Del Pia, Robert Hildebrand
Complexity, exactness, and rationality in polynomial optimization. Math. Program. 197(2): 661-692 (2023) - [i12]Robert Ferrando, Laurent Pagnier, Robert Mieth, Zhirui Liang, Yury Dvorkin, Daniel Bienstock, Michael Chertkov
A Physics-Informed Machine Learning for Electricity Markets: A NYISO Case Study. CoRR abs/2304.00062 (2023) - 2022
- [j65]Daniel Bienstock
Mathematical programming formulations for the alternating current optimal power flow problem. Ann. Oper. Res. 314(1): 277-315 (2022) - [j64]Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli
On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. 44(Part): 100567 (2022) - [j63]Daniel Bienstock, Giacomo Zambelli:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020. Math. Program. 192(1): 1-2 (2022) - [c21]Daniel Bienstock, Minchan Jeong, Apurv Shukla, Se-Young Yun:
Robust Streaming PCA. NeurIPS 2022 - 2021
- [j62]Daniel Bienstock
Pitch, extension complexity, and covering problems. Oper. Res. Lett. 49(3): 357-364 (2021) - [c20]Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
Complexity, Exactness, and Rationality in Polynomial Optimization. IPCO 2021: 58-72 - [i11]Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz:
Cardinality Minimization, Constraints, and Regularization: A Survey. CoRR abs/2106.09606 (2021) - 2020
- [j61]Dan Bienstock, Mauro Escobar
Mathematical programming formulations for the alternating current optimal power flow problem. 4OR 18(3): 249-292 (2020) - [j60]Daniel Bienstock, Chen Chen
Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183(1): 105-148 (2020) - [j59]Daniel Bienstock, Giacomo Nannicini:
Special issue forward: the 2018 Mixed Integer Programming workshop. Math. Program. Comput. 12(2): 131 (2020) - [j58]Daniel Bienstock
Stochastic Defense Against Complex Grid Attacks. IEEE Trans. Control. Netw. Syst. 7(2): 842-854 (2020) - [e2]Daniel Bienstock, Giacomo Zambelli:
Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12125, Springer 2020, ISBN 978-3-030-45770-9 [contents]
2010 – 2019
- 2019
- [j57]Daniel Bienstock, Abhinav Verma:
Strong NP-hardness of AC power flows feasibility. Oper. Res. Lett. 47(6): 494-501 (2019) - [j56]Kaarthik Sundar
Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty. IEEE Trans. Control. Netw. Syst. 6(3): 1062-1074 (2019) - [j55]Daniel Bienstock
Variance-Aware Optimal Power Flow: Addressing the Tradeoff Between Cost, Security, and Variability. IEEE Trans. Control. Netw. Syst. 6(3): 1185-1196 (2019) - [c19]Daniel Bienstock, Chen Chen
Intersection Cuts for Polynomial Optimization. IPCO 2019: 72-87 - [i10]Daniel Bienstock, Apurv Shukla, Seyoung Yun:
Non-Stationary Streaming PCA. CoRR abs/1902.03223 (2019) - 2018
- [j54]Daniel Bienstock, Gonzalo Muñoz
LP Formulations for Polynomial Optimization Problems. SIAM J. Optim. 28(2): 1121-1150 (2018) - [i9]Daniel Bienstock, Gonzalo Muñoz, Sebastian Pokutta:
Principled Deep Neural Network Training through Linear Programming. CoRR abs/1810.03218 (2018) - 2017
- [j53]Daniel Bienstock, Mauro Escobar
Computing undetectable attacks on power grids. SIGMETRICS Perform. Evaluation Rev. 45(2): 115-118 (2017) - [c18]Daniel Bienstock, Gonzalo Muñoz
Robust linear control of storage in transmission systems, and extensions to robust network control problems. CDC 2017: 799-806 - [i8]Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
A Modified Benders Decomposition for Chance-Constrained Unit Commitment with N-1 Security and Wind Uncertainty. CoRR abs/1703.05206 (2017) - 2016
- [b1]Daniel Bienstock:
Electrical transmission system cascades and vulnerability - an operations research viewpoint. MOS-SIAM Series on Optimization 22, SIAM 2016, ISBN 978-1-611-97415-7, pp. 1-294 - [j52]Daniel Bienstock:
A Note on Polynomial Solvability of the CDT Problem. SIAM J. Optim. 26(1): 488-498 (2016) - [j51]Taedong Kim
Analyzing Vulnerability of Power Systems with Continuous Optimization Formulations. IEEE Trans. Netw. Sci. Eng. 3(3): 132-146 (2016) - [c17]Carsten Matke, Daniel Bienstock, Gonzalo Muñoz
Robust optimization of power network operation: storage devices and the role of forecast errors in renewable energies. COMPLEX NETWORKS 2016: 809-820 - [c16]Kaarthik Sundar
Unit commitment with N-1 Security and wind uncertainty. PSCC 2016: 1-7 - [i7]Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
Unit Commitment with N-1 Security and Wind Uncertainty. CoRR abs/1602.00079 (2016) - 2015
- [j50]Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould
A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell. Math. Program. Comput. 7(3): 235 (2015) - [i6]Daniel Bienstock, Gonzalo Muñoz:
LP approximations to mixed-integer polynomial optimization problems. CoRR abs/1501.00288 (2015) - 2014
- [j49]Daniel Bienstock, Alexander Michalka:
Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets. SIAM J. Optim. 24(2): 643-677 (2014) - [j48]Daniel Bienstock, Michael Chertkov
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty. SIAM Rev. 56(3): 461-495 (2014) - [c15]Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman:
Power grid vulnerability to geographically correlated failures - Analysis and control implications. INFOCOM 2014: 2634-2642 - [c14]Daniel Bienstock, Alexander Michalka:
Polynomial Solvability of Variants of the Trust-Region Subproblem. SODA 2014: 380-390 - [i5]Scott Backhaus, Russell Bent, Daniel Bienstock, Michael Chertkov, Krishnamurthy Dvijotham:
Efficient Synchronization Stability Metrics for Fault Clearing. CoRR abs/1409.4451 (2014) - 2013
- [c13]Daniel Bienstock, Jose H. Blanchet, Juan Li:
Stochastic models and control for electrical power line temperature. Allerton 2013: 1344-1348 - [c12]Daniel Bienstock, Michael Chertkov
Robust modeling of probabilistic uncertainty in smart Grids: Data ambiguous Chance Constrained Optimum Power Flow. CDC 2013: 4335-4340 - [c11]Jose H. Blanchet, Daniel Bienstock, Juan Li:
Power line control under uncertainty of ambient temperature. CDC 2013: 4977-4982 - [i4]Russell Bent, Daniel Bienstock, Michael Chertkov:
Synchronization-Aware and Algorithm-Efficient Chance Constrained Optimal Power Flow. CoRR abs/1306.2972 (2013) - [i3]Daniel Bienstock, Jay Sethuraman, Chun Ye:
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming. CoRR abs/1311.4563 (2013) - 2012
- [j47]Daniel Bienstock, Benjamin McClosky:
Tightening simple mixed-integer sets with guaranteed bounds. Math. Program. 133(1-2): 337-363 (2012) - [j46]Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman:
Sensitivity analysis of the power grid vulnerability to large-scale cascading failures. SIGMETRICS Perform. Evaluation Rev. 40(3): 33-37 (2012) - [i2]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) - [i1]Daniel Bienstock, Michael Chertkov, Sean Harnett:
Chance Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty. CoRR abs/1209.5779 (2012) - 2011
- [c10]Daniel Bienstock:
Optimal control of cascading power grid failures. CDC/ECC 2011: 2166-2173 - 2010
- [j45]Daniel Bienstock, Abhinav Verma:
The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments. SIAM J. Optim. 20(5): 2352-2380 (2010) - [c9]Daniel Bienstock, Mark Zuckerberg:
Solving LP Relaxations of Large-Scale Precedence Constrained Problems. IPCO 2010: 1-14 - [c8]Daniel Bienstock:
Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. IPCO 2010: 29-42
2000 – 2009
- 2008
- [j44]Daniel Bienstock, Nuri Özbay:
Computing robust basestock levels. Discret. Optim. 5(2): 389-414 (2008) - [j43]Daniel Bienstock:
Approximate formulations for 0-1 knapsack sets. Oper. Res. Lett. 36(3): 317-320 (2008) - 2007
- [j42]Daniel Bienstock, Sara Mattia:
Using mixed-integer programming to solve power grid blackout problems. Discret. Optim. 4(1): 115-141 (2007) - 2006
- [j41]Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee:
Foreword. Ann. Oper. Res. 146(1): 1-2 (2006) - [j40]Daniel Bienstock, Olga Raskina, Iraj Saniee, Qiong Wang:
Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation. Oper. Res. 54(2): 261-276 (2006) - [j39]Daniel Bienstock, Mark Zuckerberg:
Approximate fixed-rank closures of covering problems. Math. Program. 105(1): 9-27 (2006) - [j38]Daniel Bienstock, Garud Iyengar:
Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations. SIAM J. Comput. 35(4): 825-854 (2006) - 2004
- [j37]Daniel Bienstock, Nuri Özbay:
Tree-width and the Sherali-Adams operator. Discret. Optim. 1(1): 13-21 (2004) - [j36]Daniel Bienstock, Mark Zuckerberg:
Subset Algebra Lift Operators for 0-1 Integer Programming. SIAM J. Optim. 15(1): 63-95 (2004) - [c7]Daniel Bienstock, Garud Iyengar:
Solving fractional packing problems in Oast(1/?) iterations. STOC 2004: 146-155 - [e1]George L. Nemhauser, Daniel Bienstock:
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 [contents] - 2002
- [j35]Daniel Bienstock, Olga Raskina:
Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. 91(3): 479-492 (2002) - 2001
- [j34]Daniel Bienstock, Iraj Saniee:
ATM Network Design: Traffic Models and Optimization-Based Heuristics. Telecommun. Syst. 16(3-4): 399-421 (2001) - 2000
- [j33]Daniel Bienstock, Gabriella Muratore:
Strong inequalities for capacitated survivable network design problems. Math. Program. 89(1): 127-147 (2000) - [c6]Daniel Bienstock:
epsilon-Approximate linear programs: new bounds and computation. SODA 2000: 1-2
1990 – 1999
- 1998
- [j32]Daniel Bienstock, Sunil Chopra
Minimum cost capacity installation for multicommodity network flows. Math. Program. 81: 177-199 (1998) - 1996
- [j31]Daniel Bienstock, Oktay Günlük
Capacitated Network Design - Polyhedral Structure and Computation. INFORMS J. Comput. 8(3): 243-259 (1996) - [j30]Daniel Bienstock:
Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74: 121-140 (1996) - 1995
- [j29]Daniel Bienstock, Oktay Günlük
Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. 68: 213-237 (1995) - [c5]Daniel Bienstock:
Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. IPCO 1995: 80-94 - 1994
- [j28]Daniel Bienstock, Oktay Günlük
A degree sequence problem related to network design. Networks 24(4): 195-205 (1994) - 1993
- [j27]Daniel Bienstock, Nathaniel Dean:
Bounds for rectilinear crossing numbers. J. Graph Theory 17(3): 333-348 (1993) - [j26]Daniel Bienstock:
A Lot-Sizing Problem on Trees, Related to Network Design. Math. Oper. Res. 18(2): 402-422 (1993) - [j25]Daniel Bienstock, Julien Bramel, David Simchi-Levi:
A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Math. Oper. Res. 18(4): 786-802 (1993) - [j24]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) - [j23]Daniel Bienstock, Nicole Diaz:
Blocking Small Cuts in a Network, and Related Problems. SIAM J. Comput. 22(3): 482-499 (1993) - [j22]Daniel Bienstock:
Computational experience with an effective heuristic for some capacity expansion problems in local access networks. Telecommun. Syst. 1(1): 379-400 (1993) - 1992
- [j21]Daniel Bienstock:
Corrigendum to: D. Bienstock, "On the complexity of testing for odd holes and induced odd paths" Discrete Mathematics 90 (1991) 85-92. Discret. Math. 102(1): 109 (1992) - [j20]Daniel Bienstock, Nathaniel Dean:
On obstructions to small face covers in planar graphs. J. Comb. Theory B 55(2): 163-189 (1992) - [j19]Daniel Bienstock, Nathaniel Dean:
New results on rectilinear crossing numbers and plane embeddings. J. Graph Theory 16(5): 389-398 (1992) - [c4]Daniel Bienstock:
A Lot-Sizing Problem on Trees, Related to Network Design. IPCO 1992: 421-434 - 1991
- [j18]Marshall W. Bern, Daniel Bienstock:
Polynomially solvable special cases of the Steiner problem in planar networks. Ann. Oper. Res. 33(6): 403-418 (1991) - [j17]Daniel Bienstock:
Some Provably Hard Crossing Number Problems. Discret. Comput. Geom. 6: 443-459 (1991) - [j16]Daniel Bienstock:
On the complexity of testing for odd holes and induced odd paths. Discret. Math. 90(1): 85-92 (1991) - [j15]Daniel Bienstock, Paul D. Seymour
Monotonicity in Graph Searching. J. Algorithms 12(2): 239-245 (1991) - [j14]Daniel Bienstock, Neil Robertson, Paul D. Seymour
Quickly excluding a forest. J. Comb. Theory B 52(2): 274-283 (1991) - [j13]Dan Bienstock:
Some Generalized Max-Flow Min-Cut Problems in the Plane. Math. Oper. Res. 16(2): 310-333 (1991) - [j12]Daniel Bienstock, Ervin Györi:
An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discret. Math. 4(1): 17-27 (1991) - 1990
- [j11]Daniel Bienstock, Clyde L. Monma:
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. Algorithmica 5(1): 93-109 (1990) - [j10]Daniel Bienstock:
On embedding graphs in trees. J. Comb. Theory B 49(1): 103-136 (1990) - [j9]Dan Bienstock, Odile Marcotte:
On a Network Design Problem That Is Intractable on Trees. Math. Oper. Res. 15(3): 530-544 (1990) - [j8]Daniel Bienstock:
Linear-Time Test for Small Face Covers in Any Fixed Surface. SIAM J. Comput. 19(5): 907-911 (1990) - [j7]Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma:
On the Structure of Minimum-Weight k-Connected Spanning Networks. SIAM J. Discret. Math. 3(3): 320-329 (1990) - [c3]Daniel Bienstock:
Some Provably Hard Crossing Number Problems. SCG 1990: 253-260 - [c2]Daniel Bienstock:
Some Provably Hard Crossing Number Problems. IPCO 1990: 61-83
1980 – 1989
- 1989
- [j6]Daniel Bienstock, Clyde L. Monma:
Optimal enclosing regions in planar graphs. Networks 19(1): 79-94 (1989) - [c1]Daniel Bienstock:
Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey). Reliability Of Computer And Communication Networks 1989: 33-50 - 1988
- [j5]Daniel Bienstock:
Broadcasting with random faults. Discret. Appl. Math. 20(1): 1-7 (1988) - [j4]Daniel Bienstock, Ervin Györi:
Average distance in graphs with removed elements. J. Graph Theory 12(3): 375-390 (1988) - [j3]Daniel Bienstock:
Some Lattice-Theoretic Tools for Network Reliability Analysis. Math. Oper. Res. 13(3): 467-478 (1988) - [j2]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) - [j1]Daniel Bienstock:
Asymptotic Analysis of some Network Reliability Models. SIAM J. Discret. Math. 1(1): 14-21 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: