Daniel Bienstock

106 papers A* 5B 9Journal 81Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Accurate linear cutting-plane relaxations for ACOPF. Math. Program. Comput. Daniel Bienstock, Matías Villagra
2025	J	`jnl`	Virtual Trading in Multi-Settlement Electricity Markets. CoRR Agostino Capponi, Garud Iyengar, Bo Yang, Daniel Bienstock
2024	—	`conf`	Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF. CDC Daniel Bienstock, Matías Villagra
2024	J	`jnl`	Cardinality Minimization, Constraints, and Regularization: A Survey. SIAM Rev. Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz
2024	J	`jnl`	Solving convex QPs with structured sparsity under indicator conditions. CoRR Daniel Bienstock, Tongtong Chen
2023	J	`jnl`	A Physics-Informed Machine Learning for Electricity Markets: A NYISO Case Study. CoRR Robert Ferrando, Laurent Pagnier, Robert Mieth, Zhirui Liang, Yury Dvorkin, Daniel Bienstock, Michael Chertkov
2023	J	`jnl`	Complexity, exactness, and rationality in polynomial optimization. Math. Program. Daniel Bienstock, Alberto Del Pia, Robert Hildebrand
2023	J	`jnl`	On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level. J. Optim. Theory Appl. Yasmine Beck, Daniel Bienstock, Martin Schmidt, Johannes Thürauf
2023	J	`jnl`	Principled deep neural network training through linear programming. Discret. Optim. Daniel Bienstock, Gonzalo Muñoz, Sebastian Pokutta
2022	J	`jnl`	Mathematical programming formulations for the alternating current optimal power flow problem. Ann. Oper. Res. Daniel Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti
2022	J	`jnl`	On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg
2022	A*	`conf`	Robust Streaming PCA. NeurIPS Daniel Bienstock, Minchan Jeong, Apurv Shukla, Se-Young Yun
2022	J	`jnl`	Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020. Math. Program. Daniel Bienstock, Giacomo Zambelli
2021	J	`jnl`	Cardinality Minimization, Constraints, and Regularization: A Survey. CoRR Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz
2021	B	`conf`	Complexity, Exactness, and Rationality in Polynomial Optimization. IPCO Daniel Bienstock, Alberto Del Pia, Robert Hildebrand
2021	J	`jnl`	Pitch, extension complexity, and covering problems. Oper. Res. Lett. Daniel Bienstock, Yuri Faenza, Xuan Zhang
2020	B	`ed.`	Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings IPCO Daniel Bienstock, Giacomo Zambelli
2020	J	`jnl`	Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. Daniel Bienstock, Chen Chen, Gonzalo Muñoz
2020	J	`jnl`	Special issue forward: the 2018 Mixed Integer Programming workshop. Math. Program. Comput. Daniel Bienstock, Giacomo Nannicini
2020	J	`jnl`	Stochastic Defense Against Complex Grid Attacks. IEEE Trans. Control. Netw. Syst. Daniel Bienstock, Mauro Escobar
2019	J	`jnl`	Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty. IEEE Trans. Control. Netw. Syst. Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock
2019	B	`conf`	Intersection Cuts for Polynomial Optimization. IPCO Daniel Bienstock, Chen Chen, Gonzalo Muñoz
2019	J	`jnl`	Non-Stationary Streaming PCA. CoRR Daniel Bienstock, Apurv Shukla, Seyoung Yun
2019	J	`jnl`	Strong NP-hardness of AC power flows feasibility. Oper. Res. Lett. Daniel Bienstock, Abhinav Verma
2019	J	`jnl`	Variance-Aware Optimal Power Flow: Addressing the Tradeoff Between Cost, Security, and Variability. IEEE Trans. Control. Netw. Syst. Daniel Bienstock, Apurv Shukla
2018	J	`jnl`	LP Formulations for Polynomial Optimization Problems. SIAM J. Optim. Daniel Bienstock, Gonzalo Muñoz
2018	J	`jnl`	Principled Deep Neural Network Training through Linear Programming. CoRR Daniel Bienstock, Gonzalo Muñoz, Sebastian Pokutta
2017	J	`jnl`	A Modified Benders Decomposition for Chance-Constrained Unit Commitment with N-1 Security and Wind Uncertainty. CoRR Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock
2017	J	`jnl`	Computing undetectable attacks on power grids. SIGMETRICS Perform. Evaluation Rev. Daniel Bienstock, Mauro Escobar
2017	—	`conf`	Robust linear control of storage in transmission systems, and extensions to robust network control problems. CDC Daniel Bienstock, Gonzalo Muñoz, Shuoguang Yang, Carsten Matke
2016	J	`jnl`	A Note on Polynomial Solvability of the CDT Problem. SIAM J. Optim. Daniel Bienstock
2016	J	`jnl`	Analyzing Vulnerability of Power Systems with Continuous Optimization Formulations. IEEE Trans. Netw. Sci. Eng. Taedong Kim, Stephen J. Wright, Daniel Bienstock, Sean Harnett
2016	—	`book`	Electrical transmission system cascades and vulnerability - an operations research viewpoint. Daniel Bienstock
2016	—	`conf`	Robust optimization of power network operation: storage devices and the role of forecast errors in renewable energies. COMPLEX NETWORKS Carsten Matke, Daniel Bienstock, Gonzalo Muñoz, Shuoguang Yang, David Kleinhans, Sebastian Sager
2016	J	`jnl`	Unit Commitment with N-1 Security and Wind Uncertainty. CoRR Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock
2016	—	`conf`	Unit commitment with N-1 Security and wind uncertainty. PSCC Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock
2015	J	`jnl`	A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell. Math. Program. Comput. Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould
2015	J	`jnl`	LP approximations to mixed-integer polynomial optimization problems. CoRR Daniel Bienstock, Gonzalo Muñoz
2014	J	`jnl`	Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty. SIAM Rev. Daniel Bienstock, Michael Chertkov, Sean Harnett
2014	J	`jnl`	Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets. SIAM J. Optim. Daniel Bienstock, Alexander Michalka
2014	J	`jnl`	Efficient Synchronization Stability Metrics for Fault Clearing. CoRR Scott Backhaus, Russell Bent, Daniel Bienstock, Michael Chertkov, Krishnamurthy Dvijotham
2014	A*	`conf`	Polynomial Solvability of Variants of the Trust-Region Subproblem. SODA Daniel Bienstock, Alexander Michalka
2014	A*	`conf`	Power grid vulnerability to geographically correlated failures - Analysis and control implications. INFOCOM Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman
2013	J	`jnl`	Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming. CoRR Daniel Bienstock, Jay Sethuraman, Chun Ye
2013	—	`conf`	Power line control under uncertainty of ambient temperature. CDC Jose H. Blanchet, Daniel Bienstock, Juan Li
2013	—	`conf`	Robust modeling of probabilistic uncertainty in smart Grids: Data ambiguous Chance Constrained Optimum Power Flow. CDC Daniel Bienstock, Michael Chertkov, Sean Harnett
2013	—	`conf`	Stochastic models and control for electrical power line temperature. Allerton Daniel Bienstock, Jose H. Blanchet, Juan Li
2013	J	`jnl`	Synchronization-Aware and Algorithm-Efficient Chance Constrained Optimal Power Flow. CoRR Russell Bent, Daniel Bienstock, Michael Chertkov
2012	J	`jnl`	Chance Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty CoRR Daniel Bienstock, Michael Chertkov, Sean Harnett
2012	J	`jnl`	Power Grid Vulnerability to Geographically Correlated Failures - Analysis and Control Implications CoRR Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman
2012	J	`jnl`	Sensitivity analysis of the power grid vulnerability to large-scale cascading failures. SIGMETRICS Perform. Evaluation Rev. Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman
2012	J	`jnl`	Tightening simple mixed-integer sets with guaranteed bounds. Math. Program. Daniel Bienstock, Benjamin McClosky
2011	—	`conf`	Optimal control of cascading power grid failures. CDC/ECC Daniel Bienstock
2010	B	`conf`	Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. IPCO Daniel Bienstock
2010	B	`conf`	Solving LP Relaxations of Large-Scale Precedence Constrained Problems. IPCO Daniel Bienstock, Mark Zuckerberg
2010	J	`jnl`	The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments. SIAM J. Optim. Daniel Bienstock, Abhinav Verma
2008	J	`jnl`	Approximate formulations for 0-1 knapsack sets. Oper. Res. Lett. Daniel Bienstock
2008	J	`jnl`	Computing robust basestock levels. Discret. Optim. Daniel Bienstock, Nuri Özbay
2007	J	`jnl`	Using mixed-integer programming to solve power grid blackout problems. Discret. Optim. Daniel Bienstock, Sara Mattia
2006	J	`jnl`	Approximate fixed-rank closures of covering problems. Math. Program. Daniel Bienstock, Mark Zuckerberg
2006	J	`jnl`	Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations. SIAM J. Comput. Daniel Bienstock, Garud Iyengar
2006	J	`jnl`	Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation. Oper. Res. Daniel Bienstock, Olga Raskina, Iraj Saniee, Qiong Wang
2006	J	`jnl`	Foreword. Ann. Oper. Res. Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee
2004	B	`ed.`	Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings IPCO George L. Nemhauser, Daniel Bienstock
2004	A*	`conf`	Solving fractional packing problems in STOC Daniel Bienstock, Garud Iyengar
2004	J	`jnl`	Subset Algebra Lift Operators for 0-1 Integer Programming. SIAM J. Optim. Daniel Bienstock, Mark Zuckerberg
2004	J	`jnl`	Tree-width and the Sherali-Adams operator. Discret. Optim. Daniel Bienstock, Nuri Özbay
2002	J	`jnl`	Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. Daniel Bienstock, Olga Raskina
2001	J	`jnl`	ATM Network Design: Traffic Models and Optimization-Based Heuristics. Telecommun. Syst. Daniel Bienstock, Iraj Saniee
2000	J	`jnl`	Strong inequalities for capacitated survivable network design problems. Math. Program. Daniel Bienstock, Gabriella Muratore
2000	A*	`conf`	epsilon-Approximate linear programs: new bounds and computation. SODA Daniel Bienstock
1998	J	`jnl`	Minimum cost capacity installation for multicommodity network flows. Math. Program. Daniel Bienstock, Sunil Chopra, Oktay Günlük, Chih-Yang Tsai
1996	J	`jnl`	Capacitated Network Design - Polyhedral Structure and Computation. INFORMS J. Comput. Daniel Bienstock, Oktay Günlük
1996	J	`jnl`	Computational study of a family of mixed-integer quadratic programming problems. Math. Program. Daniel Bienstock
1995	B	`conf`	Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. IPCO Daniel Bienstock
1995	J	`jnl`	Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. Daniel Bienstock, Oktay Günlük
1994	J	`jnl`	A degree sequence problem related to network design. Networks Daniel Bienstock, Oktay Günlük
1993	J	`jnl`	A Lot-Sizing Problem on Trees, Related to Network Design. Math. Oper. Res. Daniel Bienstock
1993	J	`jnl`	A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Math. Oper. Res. Daniel Bienstock, Julien Bramel, David Simchi-Levi
1993	J	`jnl`	A note on the prize collecting traveling salesman problem. Math. Program. Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson
1993	J	`jnl`	Blocking Small Cuts in a Network, and Related Problems. SIAM J. Comput. Daniel Bienstock, Nicole Diaz
1993	J	`jnl`	Bounds for rectilinear crossing numbers. J. Graph Theory Daniel Bienstock, Nathaniel Dean
1993	J	`jnl`	Computational experience with an effective heuristic for some capacity expansion problems in local access networks. Telecommun. Syst. Daniel Bienstock
1992	B	`conf`	A Lot-Sizing Problem on Trees, Related to Network Design. IPCO Daniel Bienstock
1992	J	`jnl`	Corrigendum to: D. Bienstock, "On the complexity of testing for odd holes and induced odd paths" Discrete Mathematics 90 (1991) 85-92. Discret. Math. Daniel Bienstock
1992	J	`jnl`	New results on rectilinear crossing numbers and plane embeddings. J. Graph Theory Daniel Bienstock, Nathaniel Dean
1992	J	`jnl`	On obstructions to small face covers in planar graphs. J. Comb. Theory B Daniel Bienstock, Nathaniel Dean
1991	J	`jnl`	An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discret. Math. Daniel Bienstock, Ervin Györi
1991	J	`jnl`	Monotonicity in Graph Searching. J. Algorithms Daniel Bienstock, Paul D. Seymour
1991	J	`jnl`	On the complexity of testing for odd holes and induced odd paths. Discret. Math. Daniel Bienstock
1991	J	`jnl`	Polynomially solvable special cases of the Steiner problem in planar networks. Ann. Oper. Res. Marshall W. Bern, Daniel Bienstock
1991	J	`jnl`	Quickly excluding a forest. J. Comb. Theory B Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
1991	J	`jnl`	Some Provably Hard Crossing Number Problems. Discret. Comput. Geom. Daniel Bienstock
1990	J	`jnl`	Linear-Time Test for Small Face Covers in Any Fixed Surface. SIAM J. Comput. Daniel Bienstock
1990	J	`jnl`	On embedding graphs in trees. J. Comb. Theory B Daniel Bienstock
1990	J	`jnl`	On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. Algorithmica Daniel Bienstock, Clyde L. Monma
1990	J	`jnl`	On the Structure of Minimum-Weight SIAM J. Discret. Math. Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma
1990	—	`conf`	Some Provably Hard Crossing Number Problems. SCG Daniel Bienstock
1990	B	`conf`	Some Provably Hard Crossing Number Problems. IPCO Daniel Bienstock
1989	—	`conf`	Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey). Reliability Of Computer And Communication Networks Daniel Bienstock
1989	J	`jnl`	Optimal enclosing regions in planar graphs. Networks Daniel Bienstock, Clyde L. Monma
1988	J	`jnl`	Asymptotic Analysis of some Network Reliability Models. SIAM J. Discret. Math. Daniel Bienstock
1988	J	`jnl`	Average distance in graphs with removed elements. J. Graph Theory Daniel Bienstock, Ervin Györi
1988	J	`jnl`	Broadcasting with random faults. Discret. Appl. Math. Daniel Bienstock
1988	J	`jnl`	On the Complexity of Covering Vertices by Faces in a Planar Graph. SIAM J. Comput. Daniel Bienstock, Clyde L. Monma
1988	J	`jnl`	Some Lattice-Theoretic Tools for Network Reliability Analysis. Math. Oper. Res. Daniel Bienstock