Edward C. Sewell
According to our database1,
Edward C. Sewell
authored at least 34 papers
between 1990 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
2
1
2
1
5
1
5
1
1
2
2
1
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
INFORMS J. Comput., 2022
2021
2019
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019
2018
The geo-graph in practice: creating United States Congressional Districts from census blocks.
Comput. Optim. Appl., 2018
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
2014
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies.
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
2012
Math. Program. Comput., 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
2011
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
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
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
2003
Eur. J. Oper. Res., 2003
Using an Integer Programming Model to Determine the Price of Combination Vaccines for Childhood Immunization.
Ann. Oper. Res., 2003
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
Eur. J. Oper. Res., 2000
1998
INFORMS J. Comput., 1998
1996
1995
Discret. Math., 1995
1993
J. Comb. Theory B, 1993
1990
Stability Critical Graphs and Even Subdivisions of K_4.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990