The following pages link to Edward C. Sewell (Q405672):
Displaying 34 items.
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- (Q683329) (redirect page) (← links)
- The geo-graph in practice: creating United States congressional districts from census blocks (Q683330) (← links)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- Stability critical graphs and even subdivisions of \(K_ 4\) (Q1321996) (← links)
- Binary integer programs with two variables per inequality (Q1363421) (← links)
- Computational analysis of a flexible assembly system design problem (Q1572965) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Solving the shortest route cut and fill problem using simulated annealing (Q1869428) (← links)
- Using an integer programming model to determine the price of combination vaccines for childhood immunization (Q1870406) (← links)
- Stability critical graphs and ranks facets of the stable set polytope (Q1910521) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Two new bidirectional search algorithms (Q2231042) (← links)
- Dynamically improved bounds bidirectional search (Q2238652) (← links)
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset (Q2356246) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
- (Q2865866) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies (Q2940541) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- An Analysis of Pediatric Vaccine Formulary Selection Problems (Q3392252) (← links)
- Cyclic best first search: Using contours to guide branch‐and‐bound algorithms (Q4632957) (← links)
- Scheduling to minimize release-time resource consumption and tardiness penalties (Q4865764) (← links)
- Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning (Q4904584) (← links)
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search (Q5086001) (← links)
- Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data (Q5301135) (← links)
- Transmission of reverberant sound through a single-leaf partition surrounded by an infinite rigid baffle (Q5596130) (← links)
- Two-dimensional solution for transmission of reverberant sound through a double partition (Q5596131) (← links)
- (Q5612395) (← links)
- (Q5687263) (← links)
