Jason J. Sauppe

According to our database, Jason J. Sauppe authored at least 15 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson

Comput. Optim. Appl., June, 2023

2022

Network flow methods for the minimum covariate imbalance problem.

Dorit S. Hochbaum, Xu Rao, Jason J. Sauppe

Eur. J. Oper. Res., 2022

2021

An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson

INFORMS J. Comput., 2021

Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search.

Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson

Comput. Oper. Res., 2021

2020

Duality in balance optimization subset selection.

Hee Youn Kwon, Jason J. Sauppe, Sheldon H. Jacobson

Ann. Oper. Res., 2020

2019

Bias in Balance Optimization Subset Selection: Exploration through examples.

Hee Youn Kwon, Jason J. Sauppe, Sheldon H. Jacobson

J. Oper. Res. Soc., 2019

2016

Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning.

David R. Morrison, Sheldon H. Jacobson, Jason J. Sauppe, Edward C. Sewell

Discret. Optim., 2016

2015

Balance Optimization Subset Selection: a framework for causal inference with observational data

Jason J. Sauppe

PhD thesis, 2015

Assigning Panels to Meeting Rooms at the National Science Foundation.

Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson

Interfaces, 2015

2014

An algorithm to solve the proportional network flow problem.

David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson

Optim. Lett., 2014

Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies.

Jason J. Sauppe, Sheldon H. Jacobson, Edward C. Sewell

INFORMS J. Comput., 2014

A Wide Branching Strategy for the Graph Coloring Problem.

David R. Morrison, Jason J. Sauppe, Edward C. Sewell, Sheldon H. Jacobson

INFORMS J. Comput., 2014

2013

Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data.

Alexander G. Nikolaev, Sheldon H. Jacobson, Wendy K. Tam Cho, Jason J. Sauppe, Edward C. Sewell

Oper. Res., 2013

A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network.

David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson

INFORMS J. Comput., 2013

2012

A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times.

Edward C. Sewell, Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson, Gio K. Kao

J. Glob. Optim., 2012