default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel Sokol
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Jake R. Watts, Joel Sokol:
A Voter-Based Stochastic Rejection-Method Framework for Asymptotically Safe Language Model Outputs. CoRR abs/2407.16994 (2024)- 2022
- [c2]Ignacio Erazo, David Goldsman, Pinar Keskinocak, Joel Sokol
:
A Simulation-Optimization Framework to Improve the Organ Transplantation Offering System. WSC 2022: 1009-1020
2010 – 2019
- 2019
- [j24]Bahar Çavdar, Joel Sokol:
A computation-implementation parallelization approach to the vehicle loading and routing problem. Networks 73(1): 119-134 (2019) - 2018
- [j23]Chengliang Zhang, George L. Nemhauser, Joel Sokol, Myun-Seok Cheon, Ahmet B. Keha:
Flexible solutions to maritime inventory routing problems with delivery time windows. Comput. Oper. Res. 89: 153-162 (2018) - [j22]Matías Siebert, Kelly Bartlett, Haejoong Kim, Shabbir Ahmed, Junho Lee, Dima Nazzal, George L. Nemhauser, Joel Sokol:
Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation. Int. J. Prod. Res. 56(1-2): 629-641 (2018) - 2017
- [j21]Jason Kolbush, Joel Sokol:
A Logistic Regression/Markov Chain Model for American College Football. Int. J. Comput. Sci. Sport 16(3): 185-196 (2017) - 2016
- [j20]Oguzhan Özlü, Joel Sokol:
An optimization approach to designing a baseball scout network. Eur. J. Oper. Res. 255(3): 948-960 (2016) - 2015
- [j19]Bahar Çavdar, Joel Sokol:
A distribution-free TSP tour length estimation model for random graphs. Eur. J. Oper. Res. 243(2): 588-598 (2015) - [j18]Bahar Çavdar, Joel Sokol:
TSP Race: Minimizing completion time in time-sensitive applications. Eur. J. Oper. Res. 244(1): 47-54 (2015) - [j17]Dimitri J. Papageorgiou, Myun-Seok Cheon, George L. Nemhauser, Joel Sokol:
Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems. Transp. Sci. 49(4): 870-885 (2015) - 2014
- [j16]Kelly Bartlett, Junho Lee, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol, Byungsoo Na:
Congestion-aware dynamic routing in automated material handling systems. Comput. Ind. Eng. 70: 176-182 (2014) - [j15]Dimitri J. Papageorgiou, George L. Nemhauser, Joel S. Sokol, Myun-Seok Cheon, Ahmet B. Keha:
MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results. Eur. J. Oper. Res. 235(2): 350-366 (2014) - [j14]Dimitri J. Papageorgiou, Ahmet B. Keha, George L. Nemhauser, Joel S. Sokol:
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing. INFORMS J. Comput. 26(4): 825-847 (2014) - [j13]Byungsoo Na, Shabbir Ahmed, George L. Nemhauser, Joel S. Sokol:
A cutting and scheduling problem in float glass manufacturing. J. Sched. 17(1): 95-107 (2014) - 2013
- [j12]Steven Hackman, Joel S. Sokol, Chen Zhou:
An Effective Approach to Integrated Learning in Capstone Design. INFORMS Trans. Educ. 13(2): 68-82 (2013) - 2012
- [j11]Noah Streib, Stephen J. Young, Joel S. Sokol:
A Major League Baseball Team Uses Operations Research to Improve Draft Preparation. Interfaces 42(2): 119-130 (2012) - 2011
- [j10]Balaji Gopalakrishnan, Seunghyun Kong, Earl R. Barnes, Ellis L. Johnson, Joel S. Sokol:
A least-squares minimum-cost network flow algorithm. Ann. Oper. Res. 186(1): 119-140 (2011) - [j9]Lori Houghtalen, Özlem Ergun, Joel S. Sokol:
Designing Mechanisms for the Management of Carrier Alliances. Transp. Sci. 45(4): 465-482 (2011)
2000 – 2009
- 2006
- [j8]Yetkin Ileri, Mokhtar Bazaraa, Ted Gifford, George L. Nemhauser, Joel S. Sokol, Erick D. Wikum:
An optimization approach for planning daily drayage operations. Central Eur. J. Oper. Res. 14(2): 141-156 (2006) - [j7]Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, George L. Nemhauser, Joel S. Sokol, Chun How Leong:
Short-term booking of air cargo space. Eur. J. Oper. Res. 174(3): 1979-1990 (2006) - 2005
- [j6]Dawn M. Strickland, Earl R. Barnes, Joel S. Sokol:
Optimal Protein Structure Alignment Using Maximum Cliques. Oper. Res. 53(3): 389-402 (2005) - [j5]I-Lin Wang, Ellis L. Johnson, Joel S. Sokol:
A Multiple Pairs Shortest Path Algorithm. Transp. Sci. 39(4): 465-476 (2005) - 2003
- [j4]Joel S. Sokol:
A Robust Heuristic for Batting Order Optimization Under Uncertainty. J. Heuristics 9(4): 353-370 (2003) - 2002
- [j3]Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang:
Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type. Oper. Res. 50(4): 617-635 (2002) - [c1]Jeff Day, George L. Nemhauser, Joel S. Sokol:
Management of Railroad Impedances for Shortest Path-based Routing. ATMOS 2002: 53-65 - 2001
- [j2]Anantaram Balakrishnan, Thomas L. Magnanti, Joel S. Sokol, Yi Wang:
Telecommunication Link Restoration Planning with Multiple Facility Types. Ann. Oper. Res. 106(1-4): 127-154 (2001) - 2000
- [j1]Iraj Saniee, Joel S. Sokol:
Virtual Path Design in Service-Specific ATM Networks. J. Heuristics 6(1): 65-83 (2000)
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-10-07 21:20 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:
