Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerald L. Thompson
Person information
- affiliation: Carnegie Mellon University, Tepper School of Business, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j27]J. K. Loots, T. H. C. Smith, Gerald L. Thompson:
An improved column subtraction method. South Afr. Comput. J. 36: 110-114 (2006)- 2002
- [j26]Gerald L. Thompson:
An Integral Simplex Algorithm for Solving Combinatorial Optimization Problems. Comput. Optim. Appl. 22(3): 351-367 (2002)
1990 – 1999
- 1998
- [j25]Hong Yan, Gerald L. Thompson:
Finding Postal Carrier Walk Paths in Mixed Graphs. Comput. Optim. Appl. 9(3): 229-247 (1998) - 1996
- [j24]Gerald L. Thompson, Sten Thore:
Preface. Ann. Oper. Res. 68(1) (1996) - [j23]Gerald L. Thompson, Sten Thore:
Exchanging heterogeneous goods via sealed bid auctions and transportation systems. Ann. Oper. Res. 68(1): 181-208 (1996) - 1995
- [j22]T. H. C. Smith, Gerald L. Thompson:
A Parallel Implementation of the Column Subtraction Algorithm. Parallel Comput. 21(1): 63-71 (1995) - 1994
- [j21]Farid Harche, Gerald L. Thompson:
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems. Comput. Oper. Res. 21(6): 689-705 (1994) - [j20]Farid Harche, John N. Hooker, Gerald L. Thompson:
A Computational Study of Satisfiability Algorithms for Propositional Logic. INFORMS J. Comput. 6(4): 423-435 (1994) - 1993
- [j19]Richard A. Sandbothe, Gerald L. Thompson:
Decision horizons for the capacitated lot size model with inventory bounds and stockouts. Comput. Oper. Res. 20(5): 455-465 (1993) - [j18]Wen Ling Hsu, Michael J. Prietula
, Gerald L. Thompson, Peng Si Ow:
A mixed-initiative scheduling workbench integrating AI, OR and HCI. Decis. Support Syst. 9(3): 245-257 (1993) - 1991
- [j17]Bharat K. Kaku, Gerald L. Thompson, Thomas E. Morton:
A hybrid heuristic for the facilities layout problem. Comput. Oper. Res. 18(3): 241-253 (1991) - 1990
- [j16]T. H. C. Smith, T. W. S. Meyer, Gerald L. Thompson:
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations. Discret. Appl. Math. 26(2-3): 209-217 (1990) - [j15]Richard A. Sandbothe, Gerald L. Thompson:
A Forward Algorithm for the Capacitated Lot Size Model with Stockouts. Oper. Res. 38(3): 474-486 (1990)
1980 – 1989
- 1987
- [j14]Cheryl Gaimon, Shantha Mohan, Gerald L. Thompson:
A network approach to cohort personnel planning using cross-sectional data. Comput. Oper. Res. 14(3): 183-196 (1987) - [j13]Daniel J. Zawack, Gerald L. Thompson:
A Dynamic Space-Time Network Flow Model for City Traffic Congestion. Transp. Sci. 21(3): 153-162 (1987) - 1986
- [j12]Gerald L. Thompson, Awanti P. Sethi:
Solution of constrained generalized transportation problems using the pivot and probe algorithm. Comput. Oper. Res. 13(1): 1-9 (1986) - 1985
- [j11]Gerald L. Thompson, Sharad Singhal:
A successful algorithm for the undirected Hamiltonian path problem. Discret. Appl. Math. 10(2): 179-195 (1985) - 1984
- [j10]Robert V. Nagelhout, Gerald L. Thompson:
A study of the bottleneck single source transportation problem. Comput. Oper. Res. 11(1): 25-36 (1984) - [j9]Awanti P. Sethi, Gerald L. Thompson:
The pivot and probe algorithm for solving a linear program. Math. Program. 29(2): 219-233 (1984) - 1980
- [j8]Robert V. Nagelhout, Gerald L. Thompson:
A single source transportation algorithm. Comput. Oper. Res. 7(3): 185-198 (1980)
1970 – 1979
- 1977
- [j7]Timothy L. Shaftel, Gerald L. Thompson:
A Simplex-Like Algorithm for the Continuous Modular Design Problem. Oper. Res. 25(5): 788-807 (1977) - [j6]V. Srinivasan, Gerald L. Thompson:
Cost operator algorithms for the transportation problem. Math. Program. 12(1): 372-391 (1977) - 1973
- [j5]V. Srinivasan, Gerald L. Thompson:
An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems. Oper. Res. 21(1): 284-295 (1973) - [j4]V. Srinivasan, Gerald L. Thompson:
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm. J. ACM 20(2): 194-213 (1973) - 1972
- [j3]V. Srinivasan, Gerald L. Thompson:
Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems. J. ACM 19(4): 712-726 (1972) - 1971
- [j2]Alice M. Dell, Roman L. Weil, Gerald L. Thompson:
Roots of Matrix Pencils: The Generalized Eigenvalue Problem [F2] (Algorithm 405). Commun. ACM 14(2): 113-117 (1971)
1960 – 1969
- 1969
- [j1]Dennis M. Moyles, Gerald L. Thompson:
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph. J. ACM 16(3): 455-460 (1969)
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 2023-09-27 22:45 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:
