Sheldon H. Jacobson

Orcid: 0000-0002-9042-8750

According to our database1, Sheldon H. Jacobson authored at least 121 papers between 1988 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Redistricting optimization with recombination: A local search case study.
Comput. Oper. Res., December, 2023

On Being a Computer Science Communicator.
Commun. ACM, November, 2023

3D geo-graphs: Efficient flip verification for the spherical zoning problem.
Discret. Appl. Math., October, 2023

Approximation algorithms for stochastic online matching with reusable resources.
Math. Methods Oper. Res., August, 2023

A Bisection Protocol for Political Redistricting.
INFORMS J. Optim., July, 2023

Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.
Comput. Optim. Appl., June, 2023

Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach.
Oper. Res., March, 2023

Votemandering: Strategies and Fairness in Political Redistricting.
CoRR, 2023

2022
Online total bipartite matching problem.
Optim. Lett., 2022

Iterative Deepening Dynamically Improved Bounds Bidirectional Search.
INFORMS J. Comput., 2022

2021
An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
INFORMS J. Comput., 2021

A review of risk-based security and its impact on TSA PreCheck.
IISE Trans., 2021

Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search.
Comput. Oper. Res., 2021

Two new bidirectional search algorithms.
Comput. Optim. Appl., 2021

Dynamically improved bounds bidirectional search.
Artif. Intell., 2021

2020
Primal-dual analysis for online interval scheduling problems.
J. Glob. Optim., 2020

Using Risk-Based Security to Quantify the Number of Firearms Missed at Airport Security Checkpoints.
INFORMS J. Appl. Anal., 2020

Approximation algorithms for scheduling C-benevolent jobs on weighted machines.
IISE Trans., 2020

Duality in balance optimization subset selection.
Ann. Oper. Res., 2020

2019
Bias in Balance Optimization Subset Selection: Exploration through examples.
J. Oper. Res. Soc., 2019

A bi-criteria multiple-choice secretary problem.
IISE Trans., 2019

An Improved Meet in the Middle Algorithm for Graphs with Unit Costs.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

2018
Online C-benevolent job scheduling on multiple machines.
Optim. Lett., 2018

The geo-graph in practice: creating United States Congressional Districts from census blocks.
Comput. Optim. Appl., 2018

Push versus pull.
Commun. ACM, 2018

2017
Five decades of healthcare simulation.
Proceedings of the 2017 Winter Simulation Conference, 2017

2016
Sequential stochastic assignment problem with time-dependent random success rates.
J. Appl. Probab., 2016

Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams.
INFORMS J. Comput., 2016

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

2015
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning.
Math. Program., 2015

Extensions of the sequential stochastic assignment problem.
Math. Methods Oper. Res., 2015

Assigning Panels to Meeting Rooms at the National Science Foundation.
Interfaces, 2015

2014
Complexity results for the basic residency scheduling problem.
J. Sched., 2014

An algorithm to solve the proportional network flow problem.
Optim. Lett., 2014

Characteristics of the maximal independent set ZDD.
J. Comb. Optim., 2014

Limiting Behavior of the Target-Dependent Stochastic Sequential Assignment Problem.
J. Appl. Probab., 2014

Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies.
INFORMS J. Comput., 2014

The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization.
INFORMS J. Comput., 2014

A Wide Branching Strategy for the Graph Coloring Problem.
INFORMS J. Comput., 2014

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset.
Eur. J. Oper. Res., 2014

Solving the Pricing Problem in a Generic Branch-and-Price Algorithm using Zero-Suppressed Binary Decision Diagrams.
CoRR, 2014

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

A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network.
INFORMS J. Comput., 2013

2012
Addressing Passenger Risk Uncertainty for Aviation Security Screening.
Transp. Sci., 2012

Optimal Aviation Security Screening Strategies With Dynamic Passenger Risk Updates.
IEEE Trans. Intell. Transp. Syst., 2012

A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times.
J. Glob. Optim., 2012

Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning.
Oper. Res., 2012

A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem.
INFORMS J. Comput., 2012

New dominance rules and exploration strategies for the 1|<i>r</i><sub><i>i</i></sub>|∑<i>U</i><sub><i>i</i></sub> scheduling problem.
Comput. Optim. Appl., 2012

Teaching an advanced simulation topic.
Proceedings of the Winter Simulation Conference, 2012

2011
The impact of aviation checkpoint queues on optimizing security screening effectiveness.
Reliab. Eng. Syst. Saf., 2011

Using Markov chains to analyze the effectiveness of local search algorithms.
Discret. Optim., 2011

A framework for analyzing sub-optimal performance of local search algorithms.
Comput. Optim. Appl., 2011

Reductions for the Stable Set Problem.
Algorithmic Oper. Res., 2011

2010
Risk-Based Policies for Airport Security Checkpoint Screening.
Transp. Sci., 2010

Technical Note - Stochastic Sequential Decision-Making with a Random Number of Jobs.
Oper. Res., 2010

2009
Designing Aviation Security Passenger Screening Systems Using Nonlinear Control.
SIAM J. Control. Optim., 2009

A branch, bound, and remember algorithm for the 1| <i>r</i> <sub> <i>i</i> </sub>| Sigma <i>t</i> <sub> <i>i</i> </sub> scheduling problem.
J. Sched., 2009

Simulation Fusion.
Proceedings of the 2009 Winter Simulation Conference, 2009

2008
Application of Information Technology: A Web-based Tool for Designing Vaccine Formularies for Childhood Immunization in the United States.
J. Am. Medical Informatics Assoc., 2008

An Analysis of Pediatric Vaccine Formulary Selection Problems.
Oper. Res., 2008

An analysis of neighborhood functions on generic solution spaces.
Eur. J. Oper. Res., 2008

Finding preferred subsets of Pareto optimal solutions.
Comput. Optim. Appl., 2008

2007
A Sequential Stochastic Security System Design Problem for Aviation Security.
Transp. Sci., 2007

Algorithms for the bounded set-up knapsack problem.
Discret. Optim., 2007

Analyzing the performance of simultaneous generalized hill climbing algorithms.
Comput. Optim. Appl., 2007

Integer knapsack problems with set-up weights.
Comput. Optim. Appl., 2007

2006
Order preserving reductions and polynomial improving paths.
Oper. Res. Lett., 2006

New global optima results for the Kauffman <i>NK</i> model: handling dependency.
Math. Program., 2006

Global optima results for the Kauffman <i>NK</i> model.
Math. Program., 2006

Optimal search strategies using simultaneous generalized hill climbing algorithms.
Math. Comput. Model., 2006

Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms.
J. Glob. Optim., 2006

2005
A sensitivity analysis of matching coin game strategies.
Math. Comput. Model., 2005

Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems.
INFORMS J. Comput., 2005

An Analysis of the Alias Method for Discrete Random-Variate Generation.
INFORMS J. Comput., 2005

Data-independent neighborhood functions and strict local optima.
Discret. Appl. Math., 2005

2004
Global Optimization Performance Measures for Generalized Hill Climbing Algorithms.
J. Glob. Optim., 2004

Analyzing the Performance of Generalized Hill Climbing Algorithms.
J. Heuristics, 2004

Polynomial transformations and data-independent neighborhood functions.
Discret. Appl. Math., 2004

Designing optimal aviation baggage screening strategies using simulated annealing.
Comput. Oper. Res., 2004

A Post-Optimality Analysis Algorithm for Multi-Objective Optimization.
Comput. Optim. Appl., 2004

2003
Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey.
ACM Trans. Model. Comput. Simul., 2003

Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems.
J. Glob. Optim., 2003

Solving the shortest route cut and fill problem using simulated annealing.
Eur. J. Oper. Res., 2003

Using an Integer Programming Model to Determine the Price of Combination Vaccines for Childhood Immunization.
Ann. Oper. Res., 2003

The Theory and Practice of Simulated Annealing.
Proceedings of the Handbook of Metaheuristics, 2003

2002
Common issues in discrete optimization and discrete-event simulation.
IEEE Trans. Autom. Control., 2002

Outgoing selectee rates at hub airports.
Reliab. Eng. Syst. Saf., 2002

On the convergence of generalized hill climbing algorithms.
Discret. Appl. Math., 2002

Finite-Time Performance Analysis of Static Simulated Annealing Algorithms.
Comput. Optim. Appl., 2002

A class of convergent generalized hill climbing algorithms.
Appl. Math. Comput., 2002

2001
A convergence analysis of generalized hill climbing algorithms.
IEEE Trans. Autom. Control., 2001

Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems.
INFORMS J. Comput., 2001

Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation.
Comput. Oper. Res., 2001

Using Monte Carlo simulation to assess the value of combination vaccines for pediatric immunization.
Proceedings of the 33nd conference on Winter simulation, 2001

2000
Computational analysis of a flexible assembly system design problem.
Eur. J. Oper. Res., 2000

A sampling procedure to estimate risk probabilities in access-control security systems.
Eur. J. Oper. Res., 2000

Ordinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems.
Discret. Event Dyn. Syst., 2000

Simulation optimization: a survey of simulation optimization techniques and procedures.
Proceedings of the 32nd conference on Winter simulation, 2000

1999
Application of discrete-event simulation in health care clinics: A survey.
J. Oper. Res. Soc., 1999

On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models.
Oper. Res., 1999

Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results.
INFORMS J. Comput., 1999

A survey of ranking, selection, and multiple comparison procedures for discrete-event simulation.
Proceedings of the 31st conference on Winter simulation: Simulation, 1999

1998
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms.
Proceedings of the 30th conference on Winter simulation, 1998

1997
Metaheuristics for a Flexible Assembly System Design Problem.
J. Heuristics, 1997

Simulation of the Queston Physician Network.
Proceedings of the 29th conference on Winter simulation, 1997

1996
Computational Issues for Accessibility in Discrete Event Simulation.
ACM Trans. Model. Comput. Simul., 1996

Analyzing the temporal association between health disorders and medical treatments using probability models and Monte Carlo simulation.
Proceedings of the 28th conference on Winter simulation, 1996

1995
How difficult is the frequency selection problem?
Oper. Res. Lett., 1995

On the Simultaneous Construction of Sample Paths.
Proceedings of the 27th conference on Winter simulation, 1995

Amplitude Selection in Transient Sensitivity Analysis.
Proceedings of the 27th conference on Winter simulation, 1995

1994
Convergence Results for Harmonic Gradient Estimators.
INFORMS J. Comput., 1994

Second derivative estimation using harmonic analysis.
Ann. Oper. Res., 1994

Application of RPA and the harmonic gradient estimators to a priority queueing system.
Proceedings of the 26th conference on Winter simulation, 1994

Teaching simulation: a panel discussion.
Proceedings of the 26th conference on Winter simulation, 1994

1993
The effectiveness of finite improvement algorithms for finding global optima.
ZOR Methods Model. Oper. Res., 1993

1992
Building Correct Simulation Models is Difficult.
Proceedings of the 24th Winter Simulation Conference, 1992

1991
Driving Frequency Selection for Frequency Domain Simulation Experiments.
Oper. Res., 1991

1990
Initial transient effects in the frequency domain.
Proceedings of the 22th Winter Simulation Conference, 1990

1989
Oscillation amplitude considerations in frequency domain experiments.
Proceedings of the 21st Winter Simulation Conference, 1989

1988
The global simulation clock as the frequency domain experiment index.
Proceedings of the 20th conference on Winter simulation, 1988


  Loading...