Search
Now showing items 1-10 of 90
Shortest Path Algorithms: A Comparison
(Massachusetts Institute of Technology, Operations Research Center, 1975-10)
In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.
Some Abstract Pivot Algorithms
(Massachusetts Institute of Technology, Operations Research Center, 1974-02)
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 ...
Demand for library materials : an exercise in probability analysis
(Massachusetts Institute of Technology, Operations Research Center, 1976)
Problem Formulations and Numerical Analysis in Interger Programming and Combinatorial Optimization
(Massachusetts Institute of Technology, Operations Research Center, 1979-12)
A queuing theory, Bayesian model for the circulation of books in a library
(Massachusetts Institute of Technology, Operations Research Center, 1977)
Sensitivity analysis of the Brookhaven energy system optimization model
(Massachusetts Institute of Technology, Operations Research Center, 1977)
The Effect of Removing Accidents Repeaters From the Road
(Massachusetts Institute of Technology, Operations Research Center, 1971-12)
In newspaper editorials, public commentaries and the like, licensing authorities are often advised to solve the "accident problem" by taking the "nut behind the wheel" off the road. This paper uses six-year driver records ...
Thoughts on Curriculum Development for Public Systems Analysis
(Massachusetts Institute of Technology, Operations Research Center, 1972-04)
A model for the efficient use of energy resources
(Massachusetts Institute of Technology, Operations Research Center, 1977)
Multicommodity network flows : computational experience
(Massachusetts Institute of Technology, Operations Research Center, 1976)