We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network ...

The well-known variational principle of the optimal distribution of search effort is applied to the case where the sought-for target has been located momentarily but the search cannot begin until a time T o later, during ...

Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ...

A conic linear system is a system of the form P: find x that solves b- Ax E Cy, E Cx, where Cx and Cy are closed convex cones, and the data for the system is d = (A, b). This system is"well-posed" to the extent that (small) ...

The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems. However, the surge of activity on the ...

A number of energy planning models have been proposed for combining econometric submodels which forecast the supply and demand for energy commodities with a linear programming submodel which optimizes the processing and ...

In a previous paper [12], we introduced a new model for stochastic and dynamic vehicle routing called the dynamic traveling repairman problem (DTRP), in which a vehicle traveling at constant velocity in a Euclidean region ...

This paper reports on the application of stochastic programming with recourse models to strategic planning problems typical of those faced by an electric utility. A prototype model was constructed using realistic data, and ...