default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph F. Pekny
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j20]Kristopher L. Ezra, Daniel A. DeLaurentis, Linas Mockus, Joseph F. Pekny:
Developing Mathematical Formulations for the Integrated Problem of Sensors, Weapons, and Targets. J. Aerosp. Inf. Syst. 13(5): 175-190 (2016)- 2012
- [c3]Bradley N. Doebbeling, Matthew M. Burton, Spencer Miller, Donald L. Miller, Larry Baxter, Jorge Alvarez, Joseph F. Pekny:
Optimizing Perioperative Decision Making: Improved Information for Clinical Workflow Planning. AMIA 2012 - 2011
- [j19]Aviral Shukla, Joseph F. Pekny, Venkat Venkatasubramanian:
An optimization framework for cost effective design of refueling station infrastructure for alternative fuel vehicles. Comput. Chem. Eng. 35(8): 1431-1438 (2011) - [j18]Bri-Mathias S. Hodge, Shisheng Huang
, John D. Siirola, Joseph F. Pekny, Gintaras V. Reklaitis:
A multi-paradigm modeling framework for energy systems simulation and analysis. Comput. Chem. Eng. 35(9): 1725-1737 (2011) - [j17]Jingjie Xiao, Bri-Mathias S. Hodge, Joseph F. Pekny, Gintaras V. Reklaitis:
Operating reserve policies with high wind power penetration. Comput. Chem. Eng. 35(9): 1876-1885 (2011)
2000 – 2009
- 2008
- [j16]Vishal A. Varma, Joseph F. Pekny, Gary E. Blau, Gintaras V. Reklaitis:
A framework for addressing stochastic and combinatorial aspects of scheduling and resource allocation in pharmaceutical R&D pipelines. Comput. Chem. Eng. 32(4-5): 1000-1015 (2008) - [j15]June Young Jung, Gary E. Blau, Joseph F. Pekny, Gintaras V. Reklaitis, David Eversdyk:
Integrated safety stock management for multi-stage supply chains under production capacity constraints. Comput. Chem. Eng. 32(11): 2570-2581 (2008) - 2007
- [j14]Vishal A. Varma, Gintaras V. Reklaitis, Gary E. Blau, Joseph F. Pekny:
Enterprise-wide modeling & optimization - An overview of emerging research challenges and opportunities. Comput. Chem. Eng. 31(5-6): 692-711 (2007) - [j13]Vishal A. Varma, Reha Uzsoy, Joseph F. Pekny, Gary E. Blau:
Lagrangian heuristics for scheduling new product development projects in the pharmaceutical industry. J. Heuristics 13(5): 403-433 (2007) - 2005
- [j12]Xiaotao Wan, Joseph F. Pekny, Gintaras V. Reklaitis:
Simulation-based optimization with surrogate models - Application to supply chain management. Comput. Chem. Eng. 29(6): 1317-1328 (2005) - 2004
- [j11]June Young Jung, Gary E. Blau, Joseph F. Pekny, Gintaras V. Reklaitis, David Eversdyk:
A simulation based optimization approach to supply chain management under demand uncertainty. Comput. Chem. Eng. 28(10): 2087-2106 (2004) - 2003
- [j10]Vishal A. Varma, Joseph F. Pekny, Gintaras V. Reklaitis, Dharmashankar Subramanian:
An XML-based language for the Research & Development pipeline management problem. Comput. Chem. Eng. 27(10): 1361-1379 (2003)
1990 – 1999
- 1998
- [j9]Bala Ramachandran, Joseph F. Pekny:
Lower bounds for nonlinear assignment problems using many body interactions. Eur. J. Oper. Res. 105(1): 202-215 (1998) - 1995
- [j8]Donald L. Miller, Joseph F. Pekny:
A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities. INFORMS J. Comput. 7(3): 298-320 (1995) - 1994
- [j7]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) - [j6]Joseph F. Pekny, Donald L. Miller:
A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph. INFORMS J. Comput. 6(1): 68-81 (1994) - 1993
- [j5]Gautham K. Kudva, Joseph F. Pekny:
A distributed exact algorithm for the multiple resource constrained sequencing problem. Ann. Oper. Res. 42(1): 25-54 (1993) - [j4]Donald L. Miller, Joseph F. Pekny:
Commentary - The Role of Performance Metrics for Parallel Mathematical Programming Algorithms. INFORMS J. Comput. 5(1): 26-28 (1993) - 1992
- [j3]Joseph F. Pekny, Donald L. Miller:
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Math. Program. 55: 17-33 (1992) - 1991
- [j2]Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth:
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. J. ACM 38(4): 985-1004 (1991) - [j1]Joseph F. Pekny, Donald L. Miller, Daniel Stodolsky:
A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem. Oper. Res. Lett. 10(3): 173-176 (1991) - 1990
- [c2]Joseph F. Pekny, Donald L. Miller:
A Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems. ACM Conference on Computer Science 1990: 56-62 - [c1]Joseph F. Pekny, Donald L. Miller:
An Exact Parallel Algorithm for the Resource Constrained Traveling Salesman Problem with Application to Scheduling with an Aggregate Deadline. ACM Conference on Computer Science 1990: 208-214
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:53 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:
