default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilip C. Jones
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]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)- [j22]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
- 2017
- [j21]Kamal Lamsal, Philip C. Jones, Barrett W. Thomas:
Sugarcane Harvest Logistics in Brazil. Transp. Sci. 51(2): 771-789 (2017) - 2016
- [j20]Kamal Lamsal, Philip C. Jones, Barrett W. Thomas:
Harvest logistics in agricultural systems with multiple, independent producers and no on-farm storage. Comput. Ind. Eng. 91: 129-138 (2016) - 2011
- [j19]Jeffrey W. Ohlmann, Philip C. Jones:
An integer programming model for optimal pork marketing. Ann. Oper. Res. 190(1): 271-287 (2011) - [j18]Ann Melissa Campbell, Philip C. Jones:
Prepositioning supplies in preparation for disasters. Eur. J. Oper. Res. 209(2): 156-165 (2011)
2000 – 2009
- 2008
- [j17]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) - [j16]Philip C. Jones, Jeffrey W. Ohlmann:
Long-range timber supply planning for a vertically integrated paper mill. Eur. J. Oper. Res. 191(2): 558-571 (2008) - 2003
- [j15]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) - 2001
- [j14]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)
1990 – 1999
- 1997
- [j13]Philip C. Jones, Tianbing Qian:
Fully Loaded Direct Shipping Strategy in One Warehouse/N Retailer Systems without Central Inventories. Transp. Sci. 31(2): 193-195 (1997) - 1995
- [j12]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) - 1993
- [j11]Robert R. Inman, Philip C. Jones:
Decomposition for Scheduling Flexible Manufacturing Systems. Oper. Res. 41(3): 608-617 (1993) - 1990
- [j10]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
- [j9]Philip C. Jones, Eric S. Theise:
On the Equivalence of Competitive Transportation Markets and Congestion in Spatial Price Equilibrium Models. Transp. Sci. 23(2): 112-117 (1989) - 1988
- [j8]Philip C. Jones, James L. Zydiak, Wallace J. Hopp:
Stationary dual prices and depreciation. Math. Program. 41(1-3): 357-366 (1988) - 1986
- [j7]Philip C. Jones, Romesh Saigal, Michael H. Schneider:
A variable-dimension homotopy on networks for computing linear spatial equilibria. Discret. Appl. Math. 13(2-3): 131-156 (1986) - [j6]Philip C. Jones:
Even more with the Lemke complementarity algorithm. Math. Program. 34(2): 239-242 (1986) - 1985
- [j5]Philip C. Jones, Romesh Saigal, Michael H. Schneider:
Computing nonlinear network equilibria. Math. Program. 31(1): 57-66 (1985) - 1984
- [j4]Robert F. Giese, Philip C. Jones:
An economic model of short-rotation forestry. Math. Program. 28(2): 206-217 (1984) - 1983
- [j3]Philip C. Jones:
Analysis of a Dynamic Duopoly Model of Advertising. Math. Oper. Res. 8(1): 122-134 (1983) - [j2]Philip C. Jones:
A note on the Talman, Van der Heyden linear complementarity algorithm. Math. Program. 25(1): 122-124 (1983) - 1982
- [j1]Philip C. Jones, Earl S. Marwil:
Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems. Math. Oper. Res. 7(2): 245-252 (1982)
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-26 18:23 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:
