| 2008 |
|---|
| 33 | EE | Daniel Bienstock,
Nuri Özbay:
Computing robust basestock levels.
Discrete Optimization 5(2): 389-414 (2008) |
| 32 | EE | Daniel Bienstock:
Approximate formulations for 0-1 knapsack sets.
Oper. Res. Lett. 36(3): 317-320 (2008) |
| 2007 |
|---|
| 31 | EE | Daniel Bienstock,
Sara Mattia:
Using mixed-integer programming to solve power grid blackout problems.
Discrete Optimization 4(1): 115-141 (2007) |
| 2006 |
|---|
| 30 | EE | Walid Ben-Ameur,
Daniel Bienstock,
Iraj Saniee:
Foreword.
Annals OR 146(1): 1-2 (2006) |
| 29 | EE | Daniel Bienstock,
Mark Zuckerberg:
Approximate fixed-rank closures of covering problems.
Math. Program. 105(1): 9-27 (2006) |
| 28 | EE | Daniel Bienstock,
Garud Iyengar:
Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations.
SIAM J. Comput. 35(4): 825-854 (2006) |
| 2004 |
|---|
| 27 | | George L. Nemhauser,
Daniel Bienstock:
Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings
Springer 2004 |
| 26 | EE | Daniel Bienstock,
Garud Iyengar:
Solving fractional packing problems in Oast(1/?) iterations.
STOC 2004: 146-155 |
| 25 | EE | Daniel Bienstock,
Nuri Özbay:
Tree-width and the Sherali-Adams operator.
Discrete Optimization 1(1): 13-21 (2004) |
| 2001 |
|---|
| 24 | | Daniel Bienstock,
Iraj Saniee:
ATM Network Design: Traffic Models and Optimization-Based Heuristics.
Telecommunication Systems 16(3-4): 399-421 (2001) |
| 2000 |
|---|
| 23 | EE | Daniel Bienstock:
epsilon-Approximate linear programs: new bounds and computation.
SODA 2000: 1-2 |
| 1998 |
|---|
| 22 | | 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) |
| 1996 |
|---|
| 21 | | Daniel Bienstock:
Computational study of a family of mixed-integer quadratic programming problems.
Math. Program. 74: 121-140 (1996) |
| 1995 |
|---|
| 20 | | Daniel Bienstock:
Computational Study of a Family of Mixed-Integer Quadratic Programming Problems.
IPCO 1995: 80-94 |
| 19 | | Daniel Bienstock,
Oktay Günlük:
Computational experience with a difficult mixed-integer multicommodity flow problem.
Math. Program. 68: 213-237 (1995) |
| 1993 |
|---|
| 18 | | 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) |
| 17 | | Daniel Bienstock,
Nicole Diaz:
Blocking Small Cuts in a Network, and Related Problems.
SIAM J. Comput. 22(3): 482-499 (1993) |
| 1992 |
|---|
| 16 | | Daniel Bienstock:
A Lot-Sizing Problem on Trees, Related to Network Design.
IPCO 1992: 421-434 |
| 15 | EE | Daniel Bienstock,
Nathaniel Dean:
On obstructions to small face covers in planar graphs.
J. Comb. Theory, Ser. B 55(2): 163-189 (1992) |
| 1991 |
|---|
| 14 | | Daniel Bienstock:
Some Provably Hard Crossing Number Problems.
Discrete & Computational Geometry 6: 443-459 (1991) |
| 13 | EE | Daniel Bienstock:
On the complexity of testing for odd holes and induced odd paths.
Discrete Mathematics 90(1): 85-92 (1991) |
| 12 | | Daniel Bienstock,
Paul D. Seymour:
Monotonicity in Graph Searching.
J. Algorithms 12(2): 239-245 (1991) |
| 11 | EE | Daniel Bienstock,
Neil Robertson,
Paul D. Seymour,
Robin Thomas:
Quickly excluding a forest.
J. Comb. Theory, Ser. B 52(2): 274-283 (1991) |
| 10 | | Daniel Bienstock,
Ervin Györi:
An Extremal Problem on Sparse 0-1 Matrices.
SIAM J. Discrete Math. 4(1): 17-27 (1991) |
| 1990 |
|---|
| 9 | | Daniel Bienstock:
Some Provably Hard Crossing Number Problems.
IPCO 1990: 61-83 |
| 8 | EE | Daniel Bienstock:
Some Provably Hard Crossing Number Problems.
Symposium on Computational Geometry 1990: 253-260 |
| 7 | | Daniel Bienstock,
Clyde L. Monma:
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures.
Algorithmica 5(1): 93-109 (1990) |
| 6 | EE | Daniel Bienstock:
On embedding graphs in trees.
J. Comb. Theory, Ser. B 49(1): 103-136 (1990) |
| 5 | | Daniel Bienstock:
Linear-Time Test for Small Face Covers in Any Fixed Surface.
SIAM J. Comput. 19(5): 907-911 (1990) |
| 4 | | 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) |
| 1988 |
|---|
| 3 | EE | Daniel Bienstock:
Broadcasting with random faults.
Discrete Applied Mathematics 20(1): 1-7 (1988) |
| 2 | | 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) |
| 1 | | Daniel Bienstock:
Asymptotic Analysis of some Network Reliability Models.
SIAM J. Discrete Math. 1(1): 14-21 (1988) |
