Stability Critical Graphs and Even Subdivisions of K_4. - Edward C. Sewell; Leslie E. Trotter Jr. (IPCO, 1990)

An improved algorithm for exact graph coloring. - Edward C. Sewell (Cliques, Coloring, and Satisfiability, 1993)

Stability Critical Graphs and Even Subdivisions of K4. - Edward C. Sewell; Leslie E. Trotter Jr. (J. Comb. Theory B, 1993)

Stability critical graphs and ranks facets of the stable set polytope. - Edward C. Sewell; Leslie E. Trotter Jr. (Discret. Math., 1995)

Binary integer programs with two variables per inequality. - Edward C. Sewell (Math. Program., 1996)

A Branch and Bound Algorithm for the Stability Number of a Sparse Graph. - Edward C. Sewell (INFORMS J. Comput., 1998)

Computational analysis of a flexible assembly system design problem. - Ashok Kumar; Sheldon H. Jacobson; Edward C. Sewell (Eur. J. Oper. Res., 2000)

Using Monte Carlo simulation to assess the value of combination vaccines for pediatric immunization. - Sheldon H. Jacobson; Edward C. Sewell; Bruce G. Weniger (WSC, 2001)

Using an Integer Programming Model to Determine the Price of Combination Vaccines for Childhood Immunization. - Edward C. Sewell; Sheldon H. Jacobson (Ann. Oper. Res., 2003)

Solving the shortest route cut and fill problem using simulated annealing. - Darrall Henderson; Diane E. Vaughan; Sheldon H. Jacobson; Ron R. Wakefield; Edward C. Sewell (Eur. J. Oper. Res., 2003)

An Analysis of Pediatric Vaccine Formulary Selection Problems. - Shane N. Hall; Sheldon H. Jacobson; Edward C. Sewell (Oper. Res., 2008)

Application of Information Technology: A Web-based Tool for Designing Vaccine Formularies for Childhood Immunization in the United States. - Sheldon H. Jacobson; Edward C. Sewell (J. Am. Medical Informatics Assoc., 2008)

A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem. - Gio K. Kao; Edward C. Sewell; Sheldon H. Jacobson (J. Sched., 2009)

Safe Lower Bounds for Graph Coloring. - Stephan Held; William J. Cook; Edward C. Sewell (IPCO, 2011)

Reductions for the Stable Set Problem. - Edward C. Sewell; Sheldon H. Jacobson; Hemanshu Kaul (Algorithmic Oper. Res., 2011)

New dominance rules and exploration strategies for the 1|ri|∑Ui scheduling problem. - Gio K. Kao; Edward C. Sewell; Sheldon H. Jacobson; Shane N. Hall (Comput. Optim. Appl., 2012)

A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem. - Edward C. Sewell; Sheldon H. Jacobson (INFORMS J. Comput., 2012)

Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning. - Douglas M. King; Sheldon H. Jacobson; Edward C. Sewell; Wendy K. Tam Cho (Oper. Res., 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)

Maximum-weight stable sets and safe lower bounds for graph coloring. - Stephan Held; William J. Cook; Edward C. Sewell (Math. Program. Comput., 2012)

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)

Solving the Pricing Problem in a Generic Branch-and-Price Algorithm using Zero-Suppressed Binary Decision Diagrams. - David R. Morrison; Edward C. Sewell; Sheldon H. Jacobson (CoRR, 2014)

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset. - David R. Morrison; Edward C. Sewell; Sheldon H. Jacobson (Eur. J. Oper. Res., 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)

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)

Characteristics of the maximal independent set ZDD. - David R. Morrison; Edward C. Sewell; Sheldon H. Jacobson (J. Comb. Optim., 2014)

Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning. - Douglas M. King; Sheldon H. Jacobson; Edward C. Sewell (Math. Program., 2015)

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)

Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams. - David R. Morrison; Edward C. Sewell; Sheldon H. Jacobson (INFORMS J. Comput., 2016)

The geo-graph in practice: creating United States Congressional Districts from census blocks. - Douglas M. King; Sheldon H. Jacobson; Edward C. Sewell (Comput. Optim. Appl., 2018)

An Improved Meet in the Middle Algorithm for Graphs with Unit Costs. - Edward C. Sewell; John Pavlik; Sheldon H. Jacobson (SOCS, 2019)

Dynamically improved bounds bidirectional search. - Edward C. Sewell; Sheldon H. Jacobson (Artif. Intell., 2021)

Two new bidirectional search algorithms. - John Pavlik; Edward C. Sewell; Sheldon H. Jacobson (Comput. Optim. Appl., 2021)

Iterative Deepening Dynamically Improved Bounds Bidirectional Search. - John Pavlik; Edward C. Sewell; Sheldon H. Jacobson (INFORMS J. Comput., 2022)