Efficient reliability computation of some highly structured networks

Efficient reliability computation of some highly structured networks

Includes bibliographical references (leaf 17).

Bibliographic Details
Other Authors:	Bienstock, Daniel
Language:	eng
Published:	Massachusetts Institute of Technology, Operations Research Center 2004
Subjects:	Q175.M41 O616 no.142-85
Online Access:	http://hdl.handle.net/1721.1/5293

Similar Items

Some lattice-theoretic tools for network reliability analysis
Published: (2004)

An algorithm for reliability analysis of planar graphs
Published: (2004)

On the Chernoff bounds
Published: (2004)

The potential impact of expert systems in urban police services
Published: (2004)

Large scale geometric location problems.
Published: (2004)

Large scale geometric location problems (REVISED)
Published: (2004)

Successive discretization procedures for stochastic programming with recourse
Published: (2004)

Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
Published: (2004)

Multicommodity network flows : computational experience
Published: (2004)

Intuitive solution-double techniques for worst-case analysis of some survivable network design problems
Published: (2004)

A faster strongly polynomial minimum cost flow algorithm
Published: (2004)

The derivation of efficient sets
Published: (2004)

A linearization and decomposition algorithm for computing urban traffic equilibria
Published: (2004)

OPT2--an interactive computer program for conducting Bayesian hypothesis tests
Published: (2004)

A PC-oriented interactive tool for finding efficient solutions to emergency planning problems
Published: (2004)

Deterministic network optimization : a bibliography
Published: (2004)

Equilibria on a congested transportation network
Published: (2004)

Networks as an aid in transportation and contingency planning
Published: (2004)

Connectivity-splitting models for survivable network design
Published: (2004)

Tailoring Benders Decomposition for Uncapacitated Network Design
by: Wong, Richard T., et al.
Published: (2004)

Implementing primal-dual network flow algorithms
Published: (2004)

The structure of admissible points with respect to cone dominance
Published: (2004)

Polyhedral properties of the network restoration problem-with the convex hull of a special case
Published: (2004)

A queuing theory, Bayesian model for the circulation of books in a library
Published: (2004)

Facets and reformulations for solving production planning with changeover costs
Published: (2004)

Stopping time equilibria in games with stochastically monotone payoffs
Published: (2004)

New scaling algorithms for the assignment for minimum cycle mean problems
Published: (2004)

Optimal capacity expansion planning when there are learning effects
Published: (2004)

Extensions to the dynamic requirements planning model
Published: (2004)

Integration of nonlinear coal supply models and the Brookhaven Energy System Optimization Model (BESOM)
Published: (2004)

A two priority M/G/1 queue with feedback
Published: (2004)

The design of time-series comparisons under resource constraints
Published: (2004)

Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm
Published: (2004)

Analysis of a contingent experimental design : a before-and-after experiment with a baseline period of random duration
Published: (2004)

Reference guide to the framework presented in "Implementing reusable solvers : an objected-oriented framework for operations research algorithms"
Published: (2004)

An optimal parallel implementation of a quadratic transportation algorithm
Published: (2004)

Equipment selection and task assignment for multiproduct assembly system design
Published: (2004)

Financial simulations on a massively parallel connection machine
Published: (2004)

Exact solution for the Bradford distribution and its use in modelling informational data
Published: (2004)

Demand for library materials : an exercise in probability analysis
Published: (2004)