Jason J. Sauppe
Orcid: 0000-0001-9916-7000
According to our database1,
Jason J. Sauppe
authored at least 15 papers
between 2012 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2012
2014
2016
2018
2020
2022
0
1
2
3
4
1
1
2
1
1
1
1
3
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.
Comput. Optim. Appl., June, 2023
2022
Eur. J. Oper. Res., 2022
2021
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
INFORMS J. Comput., 2021
Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search.
Comput. Oper. Res., 2021
2020
2019
J. Oper. Res. Soc., 2019
2016
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning.
Discret. Optim., 2016
2015
Balance Optimization Subset Selection: a framework for causal inference with observational data
PhD thesis, 2015
Interfaces, 2015
2014
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies.
INFORMS J. Comput., 2014
2013
Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data.
Oper. Res., 2013
INFORMS J. Comput., 2013
2012
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times.
J. Glob. Optim., 2012