E. C. Sewell

From MaRDI portal
Person:405672

Available identifiers

zbMath Open sewell.edward-cMaRDI QIDQ405672

List of research outcomes





PublicationDate of PublicationType
An optimization approach for making causal inferences2024-06-10Paper
Iterative Deepening Dynamically Improved Bounds Bidirectional Search2022-06-30Paper
Dynamically improved bounds bidirectional search2021-11-02Paper
Two new bidirectional search algorithms2021-09-29Paper
Cyclic best first search: Using contours to guide branch‐and‐bound algorithms2019-05-02Paper
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning2018-05-24Paper
The geo-graph in practice: creating United States congressional districts from census blocks2018-02-06Paper
A branch, bound, and remember algorithm for the simple assembly line balancing problem2016-06-29Paper
Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams2016-05-19Paper
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset2015-07-29Paper
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning2015-02-09Paper
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies2015-01-27Paper
A Wide Branching Strategy for the Graph Coloring Problem2015-01-26Paper
Characteristics of the maximal independent set ZDD2014-09-05Paper
Reductions for the stable set problem2013-12-11Paper
Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data2013-07-02Paper
Maximum-weight stable sets and safe lower bounds for graph coloring2013-04-10Paper
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning2013-01-30Paper
A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times2013-01-03Paper
New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem2012-06-19Paper
Safe Lower Bounds for Graph Coloring2011-06-24Paper
A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem2009-09-25Paper
An Analysis of Pediatric Vaccine Formulary Selection Problems2009-08-13Paper
Using an integer programming model to determine the price of combination vaccines for childhood immunization2003-05-11Paper
Solving the shortest route cut and fill problem using simulated annealing2003-04-10Paper
Computational analysis of a flexible assembly system design problem2000-08-06Paper
Binary integer programs with two variables per inequality1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q56872631997-07-08Paper
Scheduling to minimize release-time resource consumption and tardiness penalties1996-09-15Paper
Stability critical graphs and ranks facets of the stable set polytope1996-03-24Paper
Stability critical graphs and even subdivisions of \(K_ 4\)1994-05-05Paper
Transmission of reverberant sound through a single-leaf partition surrounded by an infinite rigid baffle1970-01-01Paper
Two-dimensional solution for transmission of reverberant sound through a double partition1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56123951970-01-01Paper

Research outcomes over time

This page was built for person: E. C. Sewell