Daniel Bienstock

According to our database, Daniel Bienstock authored at least 92 papers between 1988 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Cardinality Minimization, Constraints, and Regularization: A Survey.

Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz

SIAM Rev., 2024

2023

Principled deep neural network training through linear programming.

Daniel Bienstock, Gonzalo Muñoz, Sebastian Pokutta

Discret. Optim., August, 2023

On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level.

Yasmine Beck, Daniel Bienstock, Martin Schmidt, Johannes Thürauf

J. Optim. Theory Appl., July, 2023

Complexity, exactness, and rationality in polynomial optimization.

Daniel Bienstock, Alberto Del Pia, Robert Hildebrand

Math. Program., February, 2023

A Physics-Informed Machine Learning for Electricity Markets: A NYISO Case Study.

Robert Ferrando, Laurent Pagnier, Robert Mieth, Zhirui Liang, Yury Dvorkin, Daniel Bienstock, Michael Chertkov

CoRR, 2023

2022

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020.

Daniel Bienstock, Giacomo Zambelli

Math. Program., 2022

On inequalities with bounded coefficients and pitch for the min knapsack polytope.

Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg

Discret. Optim., 2022

Robust Streaming PCA.

Daniel Bienstock, Minchan Jeong, Apurv Shukla, Se-Young Yun

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Pitch, extension complexity, and covering problems.

Daniel Bienstock, Yuri Faenza, Xuan Zhang

Oper. Res. Lett., 2021

2020

Stochastic Defense Against Complex Grid Attacks.

Daniel Bienstock, Mauro Escobar

IEEE Trans. Control. Netw. Syst., 2020

Special issue forward: the 2018 Mixed Integer Programming workshop.

Daniel Bienstock, Giacomo Nannicini

Math. Program. Comput., 2020

Outer-product-free sets for polynomial optimization and oracle-based cuts.

Daniel Bienstock, Chen Chen, Gonzalo Muñoz

Math. Program., 2020

Mathematical programming formulations for the alternating current optimal power flow problem.

Dan Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti

4OR, 2020

2019

Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty.

Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock

IEEE Trans. Control. Netw. Syst., 2019

Variance-Aware Optimal Power Flow: Addressing the Tradeoff Between Cost, Security, and Variability.

Daniel Bienstock, Apurv Shukla

IEEE Trans. Control. Netw. Syst., 2019

Strong NP-hardness of AC power flows feasibility.

Daniel Bienstock, Abhinav Verma

Oper. Res. Lett., 2019

Non-Stationary Streaming PCA.

Daniel Bienstock, Apurv Shukla, Seyoung Yun

CoRR, 2019

Intersection Cuts for Polynomial Optimization.

Daniel Bienstock, Chen Chen, Gonzalo Muñoz

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

LP Formulations for Polynomial Optimization Problems.

Daniel Bienstock, Gonzalo Muñoz

SIAM J. Optim., 2018

2017

Computing undetectable attacks on power grids.

Daniel Bienstock, Mauro Escobar

SIGMETRICS Perform. Evaluation Rev., 2017

A Modified Benders Decomposition for Chance-Constrained Unit Commitment with N-1 Security and Wind Uncertainty.

Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock

CoRR, 2017

Robust linear control of storage in transmission systems, and extensions to robust network control problems.

Daniel Bienstock, Gonzalo Muñoz, Shuoguang Yang, Carsten Matke

Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016

Analyzing Vulnerability of Power Systems with Continuous Optimization Formulations.

Taedong Kim, Stephen J. Wright, Daniel Bienstock, Sean Harnett

IEEE Trans. Netw. Sci. Eng., 2016

A Note on Polynomial Solvability of the CDT Problem.

Daniel Bienstock

SIAM J. Optim., 2016

Unit commitment with N-1 Security and wind uncertainty.

Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock

Proceedings of the Power Systems Computation Conference, 2016

Robust optimization of power network operation: storage devices and the role of forecast errors in renewable energies.

Carsten Matke, Daniel Bienstock, Gonzalo Muñoz, Shuoguang Yang, David Kleinhans, Sebastian Sager

Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

Electrical transmission system cascades and vulnerability - an operations research viewpoint.

Daniel Bienstock

MOS-SIAM Series on Optimization 22, SIAM, ISBN: 978-1-611-97415-7, 2016

2015

A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell.

Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould

Math. Program. Comput., 2015

LP approximations to mixed-integer polynomial optimization problems.

Daniel Bienstock, Gonzalo Muñoz

CoRR, 2015

2014

Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty.

Daniel Bienstock, Michael Chertkov, Sean Harnett

SIAM Rev., 2014

Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets.

Daniel Bienstock, Alexander Michalka

SIAM J. Optim., 2014

Efficient Synchronization Stability Metrics for Fault Clearing.

Scott Backhaus, Russell Bent, Daniel Bienstock, Michael Chertkov, Krishnamurthy Dvijotham

CoRR, 2014

Polynomial Solvability of Variants of the Trust-Region Subproblem.

Daniel Bienstock, Alexander Michalka

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Power grid vulnerability to geographically correlated failures - Analysis and control implications.

Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013

Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming.

Daniel Bienstock, Jay Sethuraman, Chun Ye

CoRR, 2013

Synchronization-Aware and Algorithm-Efficient Chance Constrained Optimal Power Flow.

Russell Bent, Daniel Bienstock, Michael Chertkov

CoRR, 2013

Power line control under uncertainty of ambient temperature.

Jose H. Blanchet, Daniel Bienstock, Juan Li

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Robust modeling of probabilistic uncertainty in smart Grids: Data ambiguous Chance Constrained Optimum Power Flow.

Daniel Bienstock, Michael Chertkov, Sean Harnett

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Stochastic models and control for electrical power line temperature.

Daniel Bienstock, Jose H. Blanchet, Juan Li

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Sensitivity analysis of the power grid vulnerability to large-scale cascading failures.

Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman

SIGMETRICS Perform. Evaluation Rev., 2012

Tightening simple mixed-integer sets with guaranteed bounds.

Daniel Bienstock, Benjamin McClosky

Math. Program., 2012

2011

Optimal control of cascading power grid failures.

Daniel Bienstock

Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010

The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments.

Daniel Bienstock, Abhinav Verma

SIAM J. Optim., 2010

Solving LP Relaxations of Large-Scale Precedence Constrained Problems.

Daniel Bienstock, Mark Zuckerberg

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems.

Daniel Bienstock

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2008

Approximate formulations for 0-1 knapsack sets.

Daniel Bienstock

Oper. Res. Lett., 2008

Computing robust basestock levels.

Daniel Bienstock, Nuri Özbay

Discret. Optim., 2008

2007

Using mixed-integer programming to solve power grid blackout problems.

Daniel Bienstock, Sara Mattia

Discret. Optim., 2007

2006

Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations.

Daniel Bienstock, Garud Iyengar

SIAM J. Comput., 2006

Approximate fixed-rank closures of covering problems.

Daniel Bienstock, Mark Zuckerberg

Math. Program., 2006

Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation.

Daniel Bienstock, Olga Raskina, Iraj Saniee, Qiong Wang

Oper. Res., 2006

Foreword.

Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee

Ann. Oper. Res., 2006

2004

Subset Algebra Lift Operators for 0-1 Integer Programming.

Daniel Bienstock, Mark Zuckerberg

SIAM J. Optim., 2004

Tree-width and the Sherali-Adams operator.

Daniel Bienstock, Nuri Özbay

Discret. Optim., 2004

Solving fractional packing problems in <i>O</i>^ast(1/?) iterations.

Daniel Bienstock, Garud Iyengar

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

2002

Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem.

Daniel Bienstock, Olga Raskina

Math. Program., 2002

2001

ATM Network Design: Traffic Models and Optimization-Based Heuristics.

Daniel Bienstock, Iraj Saniee

Telecommun. Syst., 2001

2000

Strong inequalities for capacitated survivable network design problems.

Daniel Bienstock, Gabriella Muratore

Math. Program., 2000

epsilon-Approximate linear programs: new bounds and computation.

Daniel Bienstock

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998

Minimum cost capacity installation for multicommodity network flows.

Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai

Math. Program., 1998

1996

Computational study of a family of mixed-integer quadratic programming problems.

Daniel Bienstock

Math. Program., 1996

Capacitated Network Design - Polyhedral Structure and Computation.

Daniel Bienstock, Oktay Günlük

INFORMS J. Comput., 1996

1995

Computational experience with a difficult mixed-integer multicommodity flow problem.

Daniel Bienstock, Oktay Günlük

Math. Program., 1995

1994

A degree sequence problem related to network design.

Daniel Bienstock, Oktay Günlük

Networks, 1994

1993

Computational experience with an effective heuristic for some capacity expansion problems in local access networks.

Daniel Bienstock

Telecommun. Syst., 1993

Blocking Small Cuts in a Network, and Related Problems.

Daniel Bienstock, Nicole Diaz

SIAM J. Comput., 1993

A note on the prize collecting traveling salesman problem.

Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson

Math. Program., 1993

A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.

Daniel Bienstock, Julien Bramel, David Simchi-Levi

Math. Oper. Res., 1993

A Lot-Sizing Problem on Trees, Related to Network Design.

Daniel Bienstock

Math. Oper. Res., 1993

Bounds for rectilinear crossing numbers.

Daniel Bienstock, Nathaniel Dean

J. Graph Theory, 1993

1992

New results on rectilinear crossing numbers and plane embeddings.

Daniel Bienstock, Nathaniel Dean

J. Graph Theory, 1992

On obstructions to small face covers in planar graphs.

Daniel Bienstock, Nathaniel Dean

J. Comb. Theory B, 1992

Corrigendum to: D. Bienstock, "On the complexity of testing for odd holes and induced odd paths" Discrete Mathematics 90 (1991) 85-92.

Daniel Bienstock

Discret. Math., 1992

1991

An Extremal Problem on Sparse 0-1 Matrices.

Daniel Bienstock, Ervin Györi

SIAM J. Discret. Math., 1991

Some Generalized Max-Flow Min-Cut Problems in the Plane.

Dan Bienstock

Math. Oper. Res., 1991

Quickly excluding a forest.

Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas

J. Comb. Theory B, 1991

Monotonicity in Graph Searching.

Daniel Bienstock, Paul D. Seymour

J. Algorithms, 1991

On the complexity of testing for odd holes and induced odd paths.

Daniel Bienstock

Discret. Math., 1991

Some Provably Hard Crossing Number Problems.

Daniel Bienstock

Discret. Comput. Geom., 1991

Polynomially solvable special cases of the Steiner problem in planar networks.

Marshall W. Bern, Daniel Bienstock

Ann. Oper. Res., 1991

1990

On the Structure of Minimum-Weight <i>k</i>-Connected Spanning Networks.

Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma

SIAM J. Discret. Math., 1990

Linear-Time Test for Small Face Covers in Any Fixed Surface.

Daniel Bienstock

SIAM J. Comput., 1990

On a Network Design Problem That Is Intractable on Trees.

Dan Bienstock, Odile Marcotte

Math. Oper. Res., 1990

On embedding graphs in trees.

Daniel Bienstock

J. Comb. Theory B, 1990

On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.

Daniel Bienstock, Clyde L. Monma

Algorithmica, 1990

1989

Optimal enclosing regions in planar graphs.

Daniel Bienstock, Clyde L. Monma

Networks, 1989

Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey).

Daniel Bienstock

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

Asymptotic Analysis of some Network Reliability Models.

Daniel Bienstock

SIAM J. Discret. Math., 1988

On the Complexity of Covering Vertices by Faces in a Planar Graph.

Daniel Bienstock, Clyde L. Monma

SIAM J. Comput., 1988

Some Lattice-Theoretic Tools for Network Reliability Analysis.

Daniel Bienstock

Math. Oper. Res., 1988

Average distance in graphs with removed elements.

Daniel Bienstock, Ervin Györi

J. Graph Theory, 1988

Broadcasting with random faults.

Daniel Bienstock

Discret. Appl. Math., 1988