default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy J. Lowe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j50]Renato E. deMatta
, Timothy J. Lowe:
Product price alignment with seller service rating and consumer satisfaction. Ann. Oper. Res. 320(2): 695-725 (2023)- [j49]Richard E. Wendell, Timothy J. Lowe, Mike M. Gordon:
Dangers in using earned duration and other earned value metrics to measure a project's schedule performance. Central Eur. J. Oper. Res. 31(2): 665-680 (2023) - 2022
- [j48]Saurabh Bansal, Timothy J. Lowe, Philip C. Jones:
Case Article - Suncrest AgriBusiness Company: Exploiting the Flexibility of Backup Capacity. INFORMS Trans. Educ. 23(1): 27-31 (2022) - [j47]Saurabh Bansal, Timothy J. Lowe, Philip C. Jones:
Case - Suncrest AgriBusiness Company: Exploiting the Flexibility of Backup Capacity. INFORMS Trans. Educ. 23(1): 32-34 (2022)
2010 – 2019
- 2015
- [j46]Renato E. deMatta, Timothy J. Lowe, Lifang Wu:
Managing Product Variety in a Supply Chain. IEEE Trans. Engineering Management 62(1): 4-17 (2015) - 2013
- [j45]Timothy J. Lowe, Thaddeus Sim:
The hub covering flow problem. J. Oper. Res. Soc. 64(7): 973-981 (2013) - 2012
- [j44]Karolina J. Glowacka, Timothy J. Lowe, Richard E. Wendell:
The Impact of Nonagility on Service Level and Project Duration. Decis. Sci. 43(5): 957-971 (2012) - 2010
- [j43]Dengfeng Zhang, Renato E. deMatta, Timothy J. Lowe:
Channel coordination in a consignment contract. Eur. J. Oper. Res. 207(2): 897-905 (2010)
2000 – 2009
- 2009
- [j42]Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco, Arie Tamir:
Aggregation error for location models: survey and analysis. Ann. Oper. Res. 167(1): 171-208 (2009) - [j41]Thaddeus Sim, Timothy J. Lowe, Barrett W. Thomas:
The stochastic p-hub center problem with service-level constraints. Comput. Oper. Res. 36(12): 3166-3177 (2009) - [j40]Lifang Wu, Renato E. deMatta, Timothy J. Lowe:
Updating a Modular Product: How to Set Time to Market and Component Quality. IEEE Trans. Engineering Management 56(2): 298-311 (2009) - [r2]Donald W. Hearn, Timothy J. Lowe:
Lagrangian Duality: BASICS. Encyclopedia of Optimization 2009: 1805-1813 - [r1]Timothy J. Lowe:
Network Location: Covering Problems. Encyclopedia of Optimization 2009: 2545-2547 - 2008
- [j39]Samuel Burer, Philip C. Jones, Timothy J. Lowe:
Coordinating the supply chain in the agricultural seed industry. Eur. J. Oper. Res. 185(1): 354-377 (2008) - [c1]Martyn Cooper, Tim Lowe, Mary Taylor:
Access to Mathematics in Web Resources for People with a Visual Impairment. ICCHP 2008: 926-933 - 2007
- [j38]Ann Melissa Campbell, Timothy J. Lowe, Li Zhang:
The p-hub center allocation problem. Eur. J. Oper. Res. 176(2): 819-835 (2007) - 2006
- [j37]Ann Melissa Campbell, Timothy J. Lowe, Li Zhang:
Upgrading arcs to minimize the maximum travel time in a network. Networks 47(2): 72-80 (2006) - 2004
- [j36]Richard L. Francis, Timothy J. Lowe, Arie Tamir, Hülya Emir-Farinas:
A framework for demand point and solution space aggregation analysis for location models. Eur. J. Oper. Res. 159(3): 574-585 (2004) - [j35]Timothy J. Lowe, Paul V. Preckel:
In This Issue. Manuf. Serv. Oper. Manag. 6(3): 199-200 (2004) - [j34]Timothy J. Lowe, Paul V. Preckel:
Decision Technologies for Agribusiness Problems: A Brief Review of Selected Literature and a Call for Research. Manuf. Serv. Oper. Manag. 6(3): 201-208 (2004) - 2003
- [j33]Philip C. Jones, Greg Kegler, Timothy J. Lowe, Rodney D. Traub:
Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Managing the Seed-Corn Supply Chain at Syngenta. Interfaces 33(1): 80-90 (2003) - 2002
- [j32]Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward:
An Improved Lower Bound for the Multimedian Location Problem. Ann. Oper. Res. 110(1-4): 17-31 (2002) - [j31]Timothy J. Lowe, Richard E. Wendell, Gang Hu:
Screening location strategies to reduce exchange rate risk. Eur. J. Oper. Res. 136(3): 573-590 (2002) - [j30]Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Worst-case incremental analysis for a class of p-facility location problems. Networks 39(3): 139-143 (2002) - 2001
- [j29]Patrick Johanns, Tim Lowe, Robert D. Plante:
Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies. Eur. J. Oper. Res. 132(3): 490-504 (2001) - [j28]Vernon Ning Hsu, Timothy J. Lowe:
Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs. Oper. Res. 49(2): 316-321 (2001) - [j27]Philip C. Jones, Timothy J. Lowe, Rodney D. Traub, Greg Kegler:
Matching Supply and Demand: The Value of a Second Chance in Producing Hybrid Seed Corn. Manuf. Serv. Oper. Manag. 3(2): 122-137 (2001) - 2000
- [j26]Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Aggregation Error Bounds for a Class of Location Models. Oper. Res. 48(2): 294-307 (2000)
1990 – 1999
- 1997
- [j25]Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir:
Structured p-facility location problems on the line solvable in polynomial time. Oper. Res. Lett. 21(4): 159-164 (1997) - 1996
- [j24]Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward:
On the location of a tree-shaped facility. Networks 28(3): 167-175 (1996) - [j23]Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco:
Row-Column Aggregation for Rectilinear Distance p-Median Problems. Transp. Sci. 30(2): 160-174 (1996) - 1995
- [j22]Philip C. Jones, Timothy J. Lowe, Georg Muller, Ning Xu, Yinyu Ye, James L. Zydiak:
Specially Structured Uncapacitated Facility Location Problems. Oper. Res. 43(4): 661-669 (1995) - 1994
- [j21]June S. Park, Chin-yuan Ho, Timothy J. Lowe:
Replicated module allocation in LAN-based concurrent processing systems. Telecommun. Syst. 3(3): 295-318 (1994) - [j20]Dilip Chhajed, Timothy J. Lowe:
Solving Structured Multifacility Location Problems Efficiently. Transp. Sci. 28(2): 104-115 (1994) - [j19]Y. Xu, Richard L. Francis, Timothy J. Lowe:
The Multimedian Location Problem on a Network Exploiting Block Structure. Transp. Sci. 28(2): 116-124 (1994) - 1993
- [j18]Ning Xu, Timothy J. Lowe:
Technical Note - On the Equivalence of Dual Methods for Two Location Problems. Transp. Sci. 27(2): 194-199 (1993) - 1992
- [j17]Dilip Chhajed, Timothy J. Lowe:
Locating facilities which interact: Some solvable cases. Ann. Oper. Res. 40(1): 101-124 (1992) - [j16]Richard L. Francis, Timothy J. Lowe:
On worst-case aggregation analysis for network location problems. Ann. Oper. Res. 40(1): 229-246 (1992) - [j15]Dilip Chhajed, Timothy J. Lowe:
m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases. Oper. Res. 40(Supplement-1): S56-S66 (1992) - [j14]Arie Tamir, Timothy J. Lowe:
The generalized P-forest problem on a tree network. Networks 22(3): 217-230 (1992) - 1991
- [j13]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) - 1990
- [j12]Tim Lowe, Malcolm I. G. Bloor, Michael J. Wilson:
Functionality in blend design. Comput. Aided Des. 22(10): 655-665 (1990) - [j11]Mark S. Daskin, Philip C. Jones, Timothy J. Lowe:
Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products. Oper. Res. 38(6): 1104-1115 (1990)
1980 – 1989
- 1989
- [j10]Erhan Erkut, Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems. Oper. Res. 37(3): 447-461 (1989) - 1988
- [j9]Rex K. Kincaid, Timothy J. Lowe, Thomas L. Morin:
The location of central structures in trees. Comput. Oper. Res. 15(2): 103-113 (1988) - [j8]Erhan Erkut, Richard L. Francis, Timothy J. Lowe:
Locating Two Facilities on a Tree Subject to Distance Constraints. Transp. Sci. 22(3): 199-208 (1988) - [j7]M.-L. Chen, Richard L. Francis, Timothy J. Lowe:
The 1-Center Problem: Exploiting Block Structure. Transp. Sci. 22(4): 259-269 (1988) - 1987
- [j6]Robert D. Plante, Timothy J. Lowe, R. Chandrasekaran:
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic. Oper. Res. 35(5): 772-783 (1987) - 1985
- [j5]M.-L. Chen, Richard L. Francis, J. F. Lawrence, Timothy J. Lowe, S. Tufekci:
Block-vertex duality and the one-median problem. Networks 15(4): 395-412 (1985) - 1982
- [j4]Barbaros C. Tansel, Richard L. Francis, Timothy J. Lowe, M.-L. Chen:
Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network. Oper. Res. 30(4): 725-744 (1982)
1970 – 1979
- 1978
- [j3]Richard L. Francis, Timothy J. Lowe, H. Donald Ratliff:
Distance Constraints for Tree Network Multifacility Location Problems. Oper. Res. 26(4): 570-596 (1978) - [j2]Jacques A. Chatelon, Donald W. Hearn, Timothy J. Lowe:
A subgradient algorithm for certain minimax and minisum problems. Math. Program. 15(1): 130-145 (1978) - 1976
- [j1]P. M. Dearing, Richard L. Francis, Timothy J. Lowe:
Convex Location Problems on Tree Networks. Oper. Res. 24(4): 628-642 (1976)
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-24 22:58 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:
