Sheldon H. Jacobson

CoRR, 2024

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods.

[BibT_eX]

[DOI]

Rahul Swamy

CoRR, 2024

2023

Redistricting optimization with recombination: A local search case study.

[BibT_eX]

[DOI]

Kiera W. Dobbs

Comput. Oper. Res., December, 2023

On Being a Computer Science Communicator.

[BibT_eX]

[DOI]

Commun. ACM, November, 2023

3D geo-graphs: Efficient flip verification for the spherical zoning problem.

[BibT_eX]

[DOI]

Ian G. Ludden

Discret. Appl. Math., October, 2023

Approximation algorithms for stochastic online matching with reusable resources.

[BibT_eX]

[DOI]

Meghan Shanks

Math. Methods Oper. Res., August, 2023

A Bisection Protocol for Political Redistricting.

[BibT_eX]

[DOI]

INFORMS J. Optim., July, 2023

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

[BibT_eX]

[DOI]

Wenda Zhang

Comput. Optim. Appl., June, 2023

Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach.

[BibT_eX]

[DOI]

Rahul Swamy

Oper. Res., March, 2023

Votemandering: Strategies and Fairness in Political Redistricting.

[BibT_eX]

[DOI]

Sanyukta Deshpande

Ian G. Ludden

CoRR, 2023

2022

Online total bipartite matching problem.

[BibT_eX]

[DOI]

Meghan Shanks

Optim. Lett., 2022

Iterative Deepening Dynamically Improved Bounds Bidirectional Search.

[BibT_eX]

[DOI]

John Pavlik

INFORMS J. Comput., 2022

2021

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

[BibT_eX]

[DOI]

Wenda Zhang

INFORMS J. Comput., 2021

A review of risk-based security and its impact on TSA PreCheck.

[BibT_eX]

[DOI]

Laura A. Albert

Kenneth Fletcher

IISE Trans., 2021

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

[BibT_eX]

[DOI]

Wenda Zhang

Comput. Oper. Res., 2021

Two new bidirectional search algorithms.

[BibT_eX]

[DOI]

John Pavlik

Comput. Optim. Appl., 2021

Dynamically improved bounds bidirectional search.

[BibT_eX]

[DOI]

Artif. Intell., 2021

2020

Primal-dual analysis for online interval scheduling problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2020

Using Risk-Based Security to Quantify the Number of Firearms Missed at Airport Security Checkpoints.

[BibT_eX]

[DOI]

INFORMS J. Appl. Anal., 2020

Approximation algorithms for scheduling C-benevolent jobs on weighted machines.

[BibT_eX]

[DOI]

IISE Trans., 2020

Duality in balance optimization subset selection.

[BibT_eX]

[DOI]

Hee Youn Kwon

Ann. Oper. Res., 2020

2019

Bias in Balance Optimization Subset Selection: Exploration through examples.

[BibT_eX]

[DOI]

Hee Youn Kwon

J. Oper. Res. Soc., 2019

A bi-criteria multiple-choice secretary problem.

[BibT_eX]

[DOI]

Negar Kiyavash

IISE Trans., 2019

An Improved Meet in the Middle Algorithm for Graphs with Unit Costs.

[BibT_eX]

[DOI]

John Pavlik

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

2018

Online C-benevolent job scheduling on multiple machines.

[BibT_eX]

[DOI]

Optim. Lett., 2018

The geo-graph in practice: creating United States Congressional Districts from census blocks.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

Push versus pull.

[BibT_eX]

[DOI]

Commun. ACM, 2018

2017

Five decades of healthcare simulation.

[BibT_eX]

[DOI]

Sally C. Brailsford

Michael W. Carter

Proceedings of the 2017 Winter Simulation Conference, 2017

2016

Sequential stochastic assignment problem with time-dependent random success rates.

[BibT_eX]

[DOI]

Golshid Baharian

Arash Khatibi

J. Appl. Probab., 2016

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2016

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

[BibT_eX]

[DOI]

Discret. Optim., 2016

2015

Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning.

[BibT_eX]

[DOI]

Math. Program., 2015

Extensions of the sequential stochastic assignment problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2015

Assigning Panels to Meeting Rooms at the National Science Foundation.

[BibT_eX]

[DOI]

Interfaces, 2015

2014

Complexity results for the basic residency scheduling problem.

[BibT_eX]

[DOI]

J. Sched., 2014

An algorithm to solve the proportional network flow problem.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Characteristics of the maximal independent set ZDD.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Limiting Behavior of the Target-Dependent Stochastic Sequential Assignment Problem.

[BibT_eX]

[DOI]

Golshid Baharian

J. Appl. Probab., 2014

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

The Weighted Set Covering Game: A Vaccine Pricing Model for Pediatric Immunization.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

A Wide Branching Strategy for the Graph Coloring Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

2013

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

[BibT_eX]

[DOI]

Oper. Res., 2013

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2013

2012

Addressing Passenger Risk Uncertainty for Aviation Security Screening.

[BibT_eX]

[DOI]

Transp. Sci., 2012

Optimal Aviation Security Screening Strategies With Dynamic Passenger Risk Updates.

[BibT_eX]

[DOI]

IEEE Trans. Intell. Transp. Syst., 2012

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

[BibT_eX]

[DOI]

J. Glob. Optim., 2012

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

[BibT_eX]

[DOI]

Oper. Res., 2012

A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

New dominance rules and exploration strategies for the 1|ri|∑Ui scheduling problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

Teaching an advanced simulation topic.

[BibT_eX]

[DOI]

Shane G. Henderson

Stewart Robinson

Proceedings of the Winter Simulation Conference, 2012

2011

The impact of aviation checkpoint queues on optimizing security screening effectiveness.

[BibT_eX]

[DOI]

Reliab. Eng. Syst. Saf., 2011

Using Markov chains to analyze the effectiveness of local search algorithms.

[BibT_eX]

[DOI]

Discret. Optim., 2011

A framework for analyzing sub-optimal performance of local search algorithms.

[BibT_eX]

[DOI]

Shane N. Hall

Darrall Henderson

Comput. Optim. Appl., 2011

Reductions for the Stable Set Problem.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2011

2010

Risk-Based Policies for Airport Security Checkpoint Screening.

[BibT_eX]

[DOI]

Transp. Sci., 2010

Technical Note - Stochastic Sequential Decision-Making with a Random Number of Jobs.

[BibT_eX]

[DOI]

Oper. Res., 2010

2009

Designing Aviation Security Passenger Screening Systems Using Nonlinear Control.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2009

A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem.

[BibT_eX]

[DOI]

Gio K. Kao

J. Sched., 2009

Simulation Fusion.

[BibT_eX]

[DOI]

Wai Kin (Victor) Chan

Barry L. Nelson

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.

[BibT_eX]

[DOI]

J. Am. Medical Informatics Assoc., 2008

An Analysis of Pediatric Vaccine Formulary Selection Problems.

[BibT_eX]

[DOI]

Shane N. Hall

Oper. Res., 2008

An analysis of neighborhood functions on generic solution spaces.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Finding preferred subsets of Pareto optimal solutions.

[BibT_eX]

[DOI]

Gio K. Kao

Comput. Optim. Appl., 2008

2007

A Sequential Stochastic Security System Design Problem for Aviation Security.

[BibT_eX]

[DOI]

Transp. Sci., 2007

Algorithms for the bounded set-up knapsack problem.

[BibT_eX]

[DOI]

Discret. Optim., 2007

Analyzing the performance of simultaneous generalized hill climbing algorithms.

[BibT_eX]

[DOI]

Diane E. Vaughan

Comput. Optim. Appl., 2007

Integer knapsack problems with set-up weights.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2007

2006

Order preserving reductions and polynomial improving paths.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

New global optima results for the Kauffman NK model: handling dependency.

[BibT_eX]

[DOI]

Math. Program., 2006

Global optima results for the Kauffman NK model.

[BibT_eX]

[DOI]

Math. Program., 2006

Optimal search strategies using simultaneous generalized hill climbing algorithms.

[BibT_eX]

[DOI]

Math. Comput. Model., 2006

Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms.

[BibT_eX]

[DOI]

J. Glob. Optim., 2006

2005

A sensitivity analysis of matching coin game strategies.

[BibT_eX]

[DOI]

I. Shyryayev

Math. Comput. Model., 2005

Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2005

An Analysis of the Alias Method for Discrete Random-Variate Generation.

[BibT_eX]

[DOI]

J. Cole Smith

INFORMS J. Comput., 2005

Data-independent neighborhood functions and strict local optima.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Global Optimization Performance Measures for Generalized Hill Climbing Algorithms.

[BibT_eX]

[DOI]

J. Glob. Optim., 2004

Analyzing the Performance of Generalized Hill Climbing Algorithms.

[BibT_eX]

[DOI]

J. Heuristics, 2004

Polynomial transformations and data-independent neighborhood functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Designing optimal aviation baggage screening strategies using simulated annealing.

[BibT_eX]

[DOI]

Thomas J. Candalino Jr.

John E. Kobza

Comput. Oper. Res., 2004

A Post-Optimality Analysis Algorithm for Multi-Objective Optimization.

[BibT_eX]

[DOI]

Vandana Venkat

James A. Stori

Comput. Optim. Appl., 2004

2003

Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey.

[BibT_eX]

[DOI]

James R. Swisher

ACM Trans. Model. Comput. Simul., 2003

Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2003

Solving the shortest route cut and fill problem using simulated annealing.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

Using an Integer Programming Model to Determine the Price of Combination Vaccines for Childhood Immunization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2003

The Theory and Practice of Simulated Annealing.

[BibT_eX]

[DOI]

Darrall Henderson

Alan W. Johnson

Proceedings of the Handbook of Metaheuristics, 2003

2002

Common issues in discrete optimization and discrete-event simulation.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2002

Outgoing selectee rates at hub airports.

[BibT_eX]

[DOI]

Julie Virta

John E. Kobza

Reliab. Eng. Syst. Saf., 2002

On the convergence of generalized hill climbing algorithms.

[BibT_eX]

[DOI]

Alan W. Johnson

Discret. Appl. Math., 2002

Finite-Time Performance Analysis of Static Simulated Annealing Algorithms.

[BibT_eX]

[DOI]

Jeffrey E. Orosz

Comput. Optim. Appl., 2002

A class of convergent generalized hill climbing algorithms.

[BibT_eX]

[DOI]

Alan W. Johnson

Appl. Math. Comput., 2002

2001

A convergence analysis of generalized hill climbing algorithms.

[BibT_eX]

[DOI]

Kelly A. Sullivan

IEEE Trans. Autom. Control., 2001

Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems.

[BibT_eX]

[DOI]

Felisa J. Vázquez-Abad

INFORMS J. Comput., 2001

Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2001

Using Monte Carlo simulation to assess the value of combination vaccines for pediatric immunization.

[BibT_eX]

[DOI]

Bruce G. Weniger

Proceedings of the 33nd conference on Winter simulation, 2001

2000

Computational analysis of a flexible assembly system design problem.

[BibT_eX]

[DOI]

Ashok Kumar

Eur. J. Oper. Res., 2000

A sampling procedure to estimate risk probabilities in access-control security systems.

[BibT_eX]

[DOI]

John E. Kobza

Marvin K. Nakayama

Eur. J. Oper. Res., 2000

Ordinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems.

[BibT_eX]

[DOI]

Kelly A. Sullivan

Discret. Event Dyn. Syst., 2000

Simulation optimization: a survey of simulation optimization techniques and procedures.

[BibT_eX]

[DOI]

Proceedings of the 32nd conference on Winter simulation, 2000

1999

Application of discrete-event simulation in health care clinics: A survey.

[BibT_eX]

[DOI]

J. Brian Jun

James R. Swisher

J. Oper. Res. Soc., 1999

On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models.

[BibT_eX]

[DOI]

Oper. Res., 1999

Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results.

[BibT_eX]

[DOI]

Mark A. Fleischer

INFORMS J. Comput., 1999

A survey of ranking, selection, and multiple comparison procedures for discrete-event simulation.

[BibT_eX]

[DOI]

James R. Swisher

Proceedings of the 31st conference on Winter simulation: Simulation, 1999

1998

Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 30th conference on Winter simulation, 1998

1997

Metaheuristics for a Flexible Assembly System Design Problem.

[BibT_eX]

[DOI]

J. Heuristics, 1997

Simulation of the Queston Physician Network.

[BibT_eX]

[DOI]

Proceedings of the 29th conference on Winter simulation, 1997

1996

Computational Issues for Accessibility in Discrete Event Simulation.

[BibT_eX]

[DOI]

ACM Trans. Model. Comput. Simul., 1996

Analyzing the temporal association between health disorders and medical treatments using probability models and Monte Carlo simulation.

[BibT_eX]

[DOI]

Proceedings of the 28th conference on Winter simulation, 1996

1995

How difficult is the frequency selection problem?

[BibT_eX]

[DOI]

Oper. Res. Lett., 1995

On the Simultaneous Construction of Sample Paths.

[BibT_eX]

[DOI]

Proceedings of the 27th conference on Winter simulation, 1995

Amplitude Selection in Transient Sensitivity Analysis.

[BibT_eX]

[DOI]

Proceedings of the 27th conference on Winter simulation, 1995

1994

Convergence Results for Harmonic Gradient Estimators.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1994

Second derivative estimation using harmonic analysis.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1994

Application of RPA and the harmonic gradient estimators to a priority queueing system.

[BibT_eX]

[DOI]

Felisa J. Vázquez-Abad

Proceedings of the 26th conference on Winter simulation, 1994

Teaching simulation: a panel discussion.

[BibT_eX]

[DOI]

Proceedings of the 26th conference on Winter simulation, 1994

1993

The effectiveness of finite improvement algorithms for finding global optima.

[BibT_eX]

[DOI]

Daniel Solow

ZOR Methods Model. Oper. Res., 1993

1992

Building Correct Simulation Models is Difficult.

[BibT_eX]

[DOI]

Proceedings of the 24th Winter Simulation Conference, 1992

1991

Driving Frequency Selection for Frequency Domain Simulation Experiments.

[BibT_eX]

[DOI]

Arnold H. Buss

Oper. Res., 1991

1990

Initial transient effects in the frequency domain.

[BibT_eX]

[DOI]

Proceedings of the 22th Winter Simulation Conference, 1990

1989

Oscillation amplitude considerations in frequency domain experiments.

[BibT_eX]

[DOI]

Proceedings of the 21st Winter Simulation Conference, 1989

1988

The global simulation clock as the frequency domain experiment index.

[BibT_eX]

[DOI]