default search action
Thomas L. Morin
Person information
- affiliation: Purdue University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
- [j17]Baback Vaziri, Shaunak S. Dabadghao
, Yuehwern Yih
Crowd-Ranking: a Markov-based method for ranking alternatives. Oper. Res. 20(1): 279-295 (2020) - 2018
- [j16]Baback Vaziri, Shaunak S. Dabadghao
Properties of sports ranking methods. J. Oper. Res. Soc. 69(5): 776-787 (2018) - 2016
- [j15]Ziho Kang
Multi-Attribute Decision Making in a Bidding Game with Imperfect Information and Uncertainty. Int. J. Inf. Technol. Decis. Mak. 15(1): 63-82 (2016) - 2012
- [j14]Thomas L. Morin, Shaunak S. Dabadghao
Proof of the perpetuity equation. Appl. Math. Lett. 25(12): 2116-2117 (2012) - 2011
- [j13]Ping Heidi Huang
Tight bounds for periodicity theorems on the unbounded Knapsack problem. Eur. J. Oper. Res. 215(2): 319-324 (2011) - 1994
- [j12]J. R. Araque G, Gautham K. Kudva, Thomas L. Morin, Joseph F. Pekny:
A branch-and-cut algorithm for vehicle routing problems. Ann. Oper. Res. 50(1): 37-59 (1994) - 1993
- [j11]Mark J. Kaiser, Thomas L. Morin:
Algorithms for computing centroids. Comput. Oper. Res. 20(2): 151-165 (1993) - 1992
- [j10]Robert L. Carraway, Robert J. Chambers, Thomas L. Morin, Herbert Moskowitz:
Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming. Comput. Oper. Res. 19(1): 69-77 (1992) - 1991
- [j9]Robert J. Chambers, Robert L. Carraway, Timothy J. Lowe, Thomas L. Morin:
Dominance and Decomposition Heuristics for Single Machine Scheduling. Oper. Res. 39(4): 639-647 (1991) - [j8]D. Veeramani, Thomas L. Morin:
Evaluating part designs for automatic feeding in robotic assembly systems: A geometric analysis of the nesting of polyhedral objects. J. Intell. Manuf. 2(6): 337-351 (1991) - 1989
- [j7]Jaya Singhal, Roy E. Marsten, Thomas L. Morin:
Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The ZOOM System. INFORMS J. Comput. 1(1): 44-51 (1989) - [j6]Robert L. Carraway, Thomas L. Morin, Herbert Moskowitz:
Generalized Dynamic Programming for Stochastic Combinatorial Optimization. Oper. Res. 37(5): 819-829 (1989) - 1988
- [j5]Rex K. Kincaid, Timothy J. Lowe, Thomas L. Morin:
The location of central structures in trees. Comput. Oper. Res. 15(2): 103-113 (1988) - 1983
- [j4]V. Akileswaran, Gordon B. Hazen, Thomas L. Morin:
Complexity of the Project Sequencing Problem. Oper. Res. 31(4): 772-778 (1983) - 1978
- [j3]Roy E. Marsten, Thomas L. Morin:
A hybrid approach to discrete mathematical programming. Math. Program. 14(1): 21-40 (1978) - 1976
- [j2]Thomas L. Morin, Roy E. Marsten:
Branch-and-Bound Strategies for Dynamic Programming. Oper. Res. 24(4): 611-627 (1976) - 1975
- [j1]Thomas L. Morin:
Technical Note - Multidimensional Sequencing Rule. Oper. Res. 23(3): 576-580 (1975)
Conference and Workshop Papers
- 1996
- [c2]Thomas L. Morin, Nagabhushana Prabhu, Z. Zhang:
Complexity of the Gravitational Method for Linear Programming. FSTTCS 1996: 212-223 - 1990
- [c1]Mark J. Kaiser, Thomas L. Morin, Theodore B. Trafalis:
Centers and Invariant Points of Convex Bodies. Applied Geometry And Discrete Mathematics 1990: 367-386
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: