default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason J. Sauppe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Jason J. Sauppe:
Balance Optimization Subset Selection: a framework for causal inference with observational data. University of Illinois Urbana-Champaign, USA, 2015
Journal Articles
- 2023
- [j14]Wenda Zhang
, Jason J. Sauppe, Sheldon H. Jacobson:
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm. Comput. Optim. Appl. 85(2): 369-407 (2023) - 2022
- [j13]Dorit S. Hochbaum, Xu Rao, Jason J. Sauppe:
Network flow methods for the minimum covariate imbalance problem. Eur. J. Oper. Res. 300(3): 827-836 (2022) - 2021
- [j12]Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson:
Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search. Comput. Oper. Res. 126: 105129 (2021) - [j11]Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson:
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints. INFORMS J. Comput. 33(3): 1091-1102 (2021) - 2020
- [j10]Hee Youn Kwon, Jason J. Sauppe, Sheldon H. Jacobson:
Duality in balance optimization subset selection. Ann. Oper. Res. 289(2): 277-289 (2020) - 2019
- [j9]Hee Youn Kwon, Jason J. Sauppe, Sheldon H. Jacobson:
Bias in Balance Optimization Subset Selection: Exploration through examples. J. Oper. Res. Soc. 70(1): 67-80 (2019) - 2016
- [j8]David R. Morrison, Sheldon H. Jacobson, Jason J. Sauppe, Edward C. Sewell:
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discret. Optim. 19: 79-102 (2016) - 2015
- [j7]Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson:
Assigning Panels to Meeting Rooms at the National Science Foundation. Interfaces 45(6): 529-542 (2015) - 2014
- [j6]Jason J. Sauppe, Sheldon H. Jacobson, Edward C. Sewell:
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies. INFORMS J. Comput. 26(3): 547-566 (2014) - [j5]David R. Morrison, Jason J. Sauppe, Edward C. Sewell, Sheldon H. Jacobson:
A Wide Branching Strategy for the Graph Coloring Problem. INFORMS J. Comput. 26(4): 704-717 (2014) - [j4]David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson:
An algorithm to solve the proportional network flow problem. Optim. Lett. 8(3): 801-809 (2014) - 2013
- [j3]David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson:
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network. INFORMS J. Comput. 25(1): 2-12 (2013) - [j2]Alexander G. Nikolaev, Sheldon H. Jacobson, Wendy K. Tam Cho, Jason J. Sauppe, Edward C. Sewell:
Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data. Oper. Res. 61(2): 398-412 (2013) - 2012
- [j1]Edward C. Sewell, Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson, Gio K. Kao:
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. J. Glob. Optim. 54(4): 791-812 (2012)
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 2025-06-16 23:50 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:
