Sledovat
Daniel Bienstock
Daniel Bienstock
Liu Family Professor of Operations Research and Applied Mathematics, Columbia University
E-mailová adresa ověřena na: columbia.edu - Domovská stránka
Název
Citace
Citace
Rok
Chance-constrained optimal power flow: Risk-aware network control under uncertainty
D Bienstock, M Chertkov, S Harnett
Siam Review 56 (3), 461-495, 2014
5642014
Computational study of a family of mixed-integer quadratic programming problems
D Bienstock
Mathematical programming 74, 121-140, 1996
5351996
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
3631993
Monotonicity in graph searching
D Bienstock, P Seymour
Journal of Algorithms 12 (2), 239-245, 1991
3301991
Capacitated network design—polyhedral structure and computation
D Bienstock, O Günlük
Informs journal on Computing 8 (3), 243-259, 1996
2991996
Minimum cost capacity installation for multicommodity network flows
D Bienstock, S Chopra, O Günlük, CY Tsai
Mathematical programming 81, 177-199, 1998
2911998
The Problem in Power Grids: New Models, Formulations, and Numerical Experiments
D Bienstock, A Verma
SIAM Journal on Optimization 20 (5), 2352-2380, 2010
2292010
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
2262014
Strong NP-hardness of AC power flows feasibility
D Bienstock, A Verma
Operations Research Letters 47 (6), 494-501, 2019
2122019
Computing robust basestock levels
D Bienstock, N Özbay
Discrete Optimization 5 (2), 389-414, 2008
2112008
Graph searching, path-width, tree-width and related problems (a survey).
D Bienstock
Reliability of computer and communication networks 5, 33-50, 1989
2091989
On the complexity of testing for odd holes and induced odd paths
D Bienstock
Discrete Mathematics 90 (1), 85-92, 1991
1761991
Solving LP relaxations of large-scale precedence constrained problems
D Bienstock, M Zuckerberg
International Conference on Integer Programming and Combinatorial …, 2010
1632010
Potential function methods for approximately solving linear programming problems: theory and practice
D Bienstock
Springer Science & Business Media, 2002
1582002
Using mixed-integer programming to solve power grid blackout problems
D Bienstock, S Mattia
Discrete Optimization 4 (1), 115-141, 2007
1492007
Quickly excluding a forest
D Bienstock, N Robertson, P Seymour, R Thomas
Journal of Combinatorial Theory (Ser. B) 52, 274-283, 1991
1481991
Computational experience with a difficult mixedinteger multicommodity flow problem
D Bienstock, O Günlük
Mathematical programming 68, 213-237, 1995
1391995
Optimizing resource acquisition decisions by stochastic programming
D Bienstock, JF Shapiro
Management Science 34 (2), 215-229, 1988
1391988
Some provably hard crossing number problems
D Bienstock
Proceedings of the sixth annual symposium on Computational geometry, 253-260, 1990
1341990
Electrical transmission system cascades and vulnerability: an operations research viewpoint
D Bienstock
Society for Industrial and Applied Mathematics, 2015
1292015
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20