Jason J. Sauppe

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 7

Top Topics

Traveling Salesman

Subset Selection

Top Venues

INFORMS J. Comput.

Ann. Oper. Res.

Discret. Optim.

Publications

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) (2023)
Dorit S. Hochbaum, Xu Rao, Jason J. Sauppe
Network flow methods for the minimum covariate imbalance problem. Eur. J. Oper. Res. 300 (3) (2022)
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) (2021)
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 (2021)
Hee Youn Kwon, Jason J. Sauppe, Sheldon H. Jacobson
Duality in balance optimization subset selection. Ann. Oper. Res. 289 (2) (2020)
Hee Youn Kwon, Jason J. Sauppe, Sheldon H. Jacobson
Bias in Balance Optimization Subset Selection: Exploration through examples. J. Oper. Res. Soc. 70 (1) (2019)
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 (2016)
Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson
Assigning Panels to Meeting Rooms at the National Science Foundation. Interfaces 45 (6) (2015)
David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
An algorithm to solve the proportional network flow problem. Optim. Lett. 8 (3) (2014)
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) (2014)
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) (2014)
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) (2013)
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) (2013)
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) (2012)