Bienstock Daniel

Daniel Bienstock

Information about the author Daniel Bienstock will soon be added to the site.
Found 12 papers in total
Computing robust base stock levels
Computing robust base stock levels
2008
This paper considers how to optimally set the basestock level for a single buffer when...
Combined network design and multiperiod pricing: modeling, solution techniques, and computation
Combined network design and multiperiod pricing: modeling, solution techniques, and computation
2006
In this paper we describe an efficient algorithm for solving novel optimization models...
Using mixed-integer programming to solve power grid blackout problems
Using mixed-integer programming to solve power grid blackout problems
2007
We consider optimization problems related to the prevention of large-scale cascading...
Tree-width and the Sherali–Adams operator
Tree-width and the Sherali–Adams operator
2004
We describe a connection between the tree-width of graphs and the Sherali–Adams...
Minimum cost capacity installation for multicommodity network flows
Minimum cost capacity installation for multicommodity network flows
1998
Consider a directed graph G = ( V,A ), and a set of traffic demands to be shipped...
Capacitated network design—polyhedral structure and computation
Capacitated network design—polyhedral structure and computation
1996
We study a capacity expansion problem that arises in telecommunication network design....
Computational study of a family of mixed-integer quadratic programming problems
Computational study of a family of mixed-integer quadratic programming problems
1996
We present computational experience with a branch-and-cut algorithm to solve quadratic...
Capacitated network design-Polyhedral structure and computation
Capacitated network design-Polyhedral structure and computation
1996
The authors study a capacity expansion problem that arises in telecommunication...
A note on the prize collecting traveling salesman problem
A note on the prize collecting traveling salesman problem
1993
The authors study the version of the prize collecting traveling salesman problem,...
A probabilistic analysis of tour partitioning heuristics for the Capacitated Vehicle Routing Problem with unsplit demands
A probabilistic analysis of tour partitioning heuristics for the Capacitated Vehicle Routing Problem with unsplit demands
1993
In the Capacitated Vehicle Routing Problem with unsplit demands, a customer’s...
Polynomially solvable special cases of the Steiner problem in planar networks
Polynomially solvable special cases of the Steiner problem in planar networks
1991
The authors give polynomial-time algorithms for two special cases of the Steiner...
Some lattice-theoretic tools for network reliability analysis
Some lattice-theoretic tools for network reliability analysis
1988
The computation of K -terminal reliability for a graph is an intractable problem, and...
Papers per page: