We stand with Ukraine  

Thomas L. Morin

Affiliations:
  • Purdue University


According to our database1, Thomas L. Morin authored at least 19 papers between 1975 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Crowd-Ranking: a Markov-based method for ranking alternatives.
[BibTeX]
[DOI]
Baback Vaziri
,
Shaunak S. Dabadghao
,
Yuehwern Yih
,
Thomas L. Morin
,
Mark R. Lehto
Oper. Res., 2020

2018
Properties of sports ranking methods.
[BibTeX]
[DOI]
Baback Vaziri
,
Shaunak S. Dabadghao
,
Yuehwern Yih
,
Thomas L. Morin
J. Oper. Res. Soc., 2018

2016
Multi-Attribute Decision Making in a Bidding Game with Imperfect Information and Uncertainty.
[BibTeX]
[DOI]
Ziho Kang
,
Thomas L. Morin
Int. J. Inf. Technol. Decis. Mak., 2016

2012
Proof of the perpetuity equation.
[BibTeX]
[DOI]
Thomas L. Morin
,
Shaunak S. Dabadghao
Appl. Math. Lett., 2012

2011
Tight bounds for periodicity theorems on the unbounded Knapsack problem.
[BibTeX]
[DOI]
Ping Heidi Huang
,
Mark A. Lawley
,
Thomas L. Morin
Eur. J. Oper. Res., 2011

1996
Complexity of the Gravitational Method for Linear Programming.
[BibTeX]
[DOI]
Thomas L. Morin
,
Nagabhushana Prabhu
,
Z. Zhang
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1994
A branch-and-cut algorithm for vehicle routing problems.
[BibTeX]
[DOI]
J. R. Araque G
,
Gautham K. Kudva
,
Thomas L. Morin
,
Joseph F. Pekny
Ann. Oper. Res., 1994

1993
Algorithms for computing centroids.
[BibTeX]
[DOI]
Mark J. Kaiser
,
Thomas L. Morin
Comput. Oper. Res., 1993

1992
Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming.
[BibTeX]
[DOI]
Robert L. Carraway
,
Robert J. Chambers
,
Thomas L. Morin
,
Herbert Moskowitz
Comput. Oper. Res., 1992

1991
Evaluating part designs for automatic feeding in robotic assembly systems: A geometric analysis of the nesting of polyhedral objects.
[BibTeX]
[DOI]
D. Veeramani
,
Thomas L. Morin
J. Intell. Manuf., 1991

Dominance and Decomposition Heuristics for Single Machine Scheduling.
[BibTeX]
[DOI]
Robert J. Chambers
,
Robert L. Carraway
,
Timothy J. Lowe
,
Thomas L. Morin
Oper. Res., 1991

1990
Centers and Invariant Points of Convex Bodies.
[BibTeX]
[DOI]
Mark J. Kaiser
,
Thomas L. Morin
,
Theodore B. Trafalis
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Generalized Dynamic Programming for Stochastic Combinatorial Optimization.
[BibTeX]
[DOI]
Robert L. Carraway
,
Thomas L. Morin
,
Herbert Moskowitz
Oper. Res., 1989

Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The ZOOM System.
[BibTeX]
[DOI]
Jaya Singhal
,
Roy E. Marsten
,
Thomas L. Morin
INFORMS J. Comput., 1989

1988
The location of central structures in trees.
[BibTeX]
[DOI]
Rex K. Kincaid
,
Timothy J. Lowe
,
Thomas L. Morin
Comput. Oper. Res., 1988

1983
Complexity of the Project Sequencing Problem.
[BibTeX]
[DOI]
V. Akileswaran
,
Gordon B. Hazen
,
Thomas L. Morin
Oper. Res., 1983

1978
A hybrid approach to discrete mathematical programming.
[BibTeX]
[DOI]
Roy E. Marsten
,
Thomas L. Morin
Math. Program., 1978

1976
Branch-and-Bound Strategies for Dynamic Programming.
[BibTeX]
[DOI]
Thomas L. Morin
,
Roy E. Marsten
Oper. Res., 1976

1975
Technical Note - Multidimensional Sequencing Rule.
[BibTeX]
[DOI]
Thomas L. Morin
Oper. Res., 1975


  Loading...