Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Thomas L. Morin is active.

Publication


Featured researches published by Thomas L. Morin.


Informs Journal on Computing | 1989

Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The zoom System

Jaya Singhal; Roy E. Marsten; Thomas L. Morin

A branch-and-bound algorithm for mixed-integer programming (MIP) is presented in which a different integer variable is designated for branching at each depth in the search tree. This is done in order to achieve economies of scale in solving the linear programming relaxations to obtain bounds for the (MIP) algorithm. This algorithm is the foundation for the zoom software system, which is briefly described. Illustrative computational experience is included. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.


Journal of Mathematical Analysis and Applications | 1974

The imbedded state space approach to reducing dimensionality in dynamic programs of higher dimensions

Thomas L. Morin; Augustine O. Esogbue

By exploiting discontinuity properties of the maximal convolution it is possible to drastically reduce dimensionality in finite dynamic programs. In fact, we show how the search over the usual M-dimensional state space can be reduced to a one-dimensional search over an imbedded state space. The versatility of our approach is illustrated on a number of example problems.


Engineering Optimization | 1975

SOLUTION OF SOME COMBINATORIAL OPTIMIZATION PROBLEMS ENCOUNTERED IN WATER RESOURCES DEVELOPMENT

Thomas L. Morin

The solution of some constrained combinatorial optimization problems encountered in the preinvestment planning of large-scale water resources systems is discussed. Mathematical structures are formulated for several problems involving the optimal selection, sequencing and timing of a set of water resources development projects which, in the aggregate, must satisfy a number of continuous time demand projections at every point in a finite planning horizon. An overview of four different solution techniques is also given. Specifically, myopic decision rules, integer programming formulations, and both implicit enumeration by branch-and-bound algorithms and dynamic programming algorithms are discussed. A computational comparison of these solution techniques on a number of real-world water resources problems of various sizes is also reported.


Management Science | 1976

An Algorithm for Nonlinear Knapsack Problems

Thomas L. Morin; Roy E. Marsten


Water Resources Research | 1971

Some Efficient Dynamic Programing Algorithms for the Optimal Sequencing and Scheduling of Water Supply Projects

Thomas L. Morin; Augustine O. Esogbue


Journal of Hydraulic Engineering | 1973

Optimal Sequencing of Capacity Expansion Projects

Thomas L. Morin


Water Resources Research | 1973

Pathology of a dynamic programing sequencing algorithm

Thomas L. Morin


Water Resources Research | 1974

A Useful Theorem in the Dynamic Programing Solution of Sequencing and Scheduling Problems Occurring in Capital Expenditure Planning

Thomas L. Morin; Augustine M.O. Esogbue


Journal of Hydraulic Engineering | 1974

Optimality of a Heuristic Sequencing Technique

Thomas L. Morin


Journal of the Urban Planning and Development Division | 1971

Discussion of Economics of Solid Waste Investment Decision by Robert M. Clark

Thomas L. Morin; Augustine O. Esogbue

Collaboration


Dive into the Thomas L. Morin's collaboration.

Top Co-Authors

Avatar

Augustine O. Esogbue

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Roy E. Marsten

Massachusetts Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Augustine M.O. Esogbue

Case Western Reserve University

View shared research outputs
Top Co-Authors

Avatar

Jaya Singhal

University of Baltimore

View shared research outputs
Researchain Logo
Decentralizing Knowledge