![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Edward C. Sewell
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j28]John Pavlik
, Edward C. Sewell, Sheldon H. Jacobson
:
Iterative Deepening Dynamically Improved Bounds Bidirectional Search. INFORMS J. Comput. 34(2): 974-989 (2022) - 2021
- [j27]Edward C. Sewell, Sheldon H. Jacobson:
Dynamically improved bounds bidirectional search. Artif. Intell. 291: 103405 (2021) - [j26]John Pavlik
, Edward C. Sewell, Sheldon H. Jacobson
:
Two new bidirectional search algorithms. Comput. Optim. Appl. 80(2): 377-409 (2021)
2010 – 2019
- 2019
- [c5]Edward C. Sewell, John Pavlik, Sheldon H. Jacobson:
An Improved Meet in the Middle Algorithm for Graphs with Unit Costs. SOCS 2019: 145-149 - 2018
- [j25]Douglas M. King, Sheldon H. Jacobson
, Edward C. Sewell:
The geo-graph in practice: creating United States Congressional Districts from census blocks. Comput. Optim. Appl. 69(1): 25-49 (2018) - 2016
- [j24]David R. Morrison, Sheldon H. Jacobson
, Jason J. Sauppe, Edward C. Sewell:
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discret. Optim. 19: 79-102 (2016) - [j23]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
:
Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams. INFORMS J. Comput. 28(1): 67-82 (2016) - 2015
- [j22]Douglas M. King, Sheldon H. Jacobson
, Edward C. Sewell:
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning. Math. Program. 149(1-2): 425-457 (2015) - 2014
- [j21]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
:
An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset. Eur. J. Oper. Res. 236(2): 403-409 (2014) - [j20]Jason J. Sauppe, Sheldon H. Jacobson
, Edward C. Sewell:
Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies. INFORMS J. Comput. 26(3): 547-566 (2014) - [j19]David R. Morrison, Jason J. Sauppe, Edward C. Sewell, Sheldon H. Jacobson
:
A Wide Branching Strategy for the Graph Coloring Problem. INFORMS J. Comput. 26(4): 704-717 (2014) - [j18]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
:
Characteristics of the maximal independent set ZDD. J. Comb. Optim. 28(1): 121-139 (2014) - [i1]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson:
Solving the Pricing Problem in a Generic Branch-and-Price Algorithm using Zero-Suppressed Binary Decision Diagrams. CoRR abs/1401.5820 (2014) - 2013
- [j17]Alexander G. Nikolaev, Sheldon H. Jacobson
, Wendy K. Tam Cho
, Jason J. Sauppe, Edward C. Sewell:
Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data. Oper. Res. 61(2): 398-412 (2013) - 2012
- [j16]Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson
, Shane N. Hall
:
New dominance rules and exploration strategies for the 1|ri|∑Ui scheduling problem. Comput. Optim. Appl. 51(3): 1253-1274 (2012) - [j15]Edward C. Sewell, Sheldon H. Jacobson
:
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem. INFORMS J. Comput. 24(3): 433-442 (2012) - [j14]Douglas M. King, Sheldon H. Jacobson
, Edward C. Sewell, Wendy K. Tam Cho
:
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning. Oper. Res. 60(5): 1213-1228 (2012) - [j13]Edward C. Sewell, Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson
, Gio K. Kao:
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. J. Glob. Optim. 54(4): 791-812 (2012) - [j12]Stephan Held, William J. Cook, Edward C. Sewell:
Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4(4): 363-381 (2012) - 2011
- [j11]Edward C. Sewell, Sheldon H. Jacobson, Hemanshu Kaul:
Reductions for the Stable Set Problem. Algorithmic Oper. Res. 6(1): 40-55 (2011) - [c4]Stephan Held, William J. Cook, Edward C. Sewell:
Safe Lower Bounds for Graph Coloring. IPCO 2011: 261-273
2000 – 2009
- 2009
- [j10]Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson
:
A branch, bound, and remember algorithm for the 1| r i | Sigma t i scheduling problem. J. Sched. 12(2): 163-175 (2009) - 2008
- [j9]Shane N. Hall
, Sheldon H. Jacobson
, Edward C. Sewell:
An Analysis of Pediatric Vaccine Formulary Selection Problems. Oper. Res. 56(6): 1348-1365 (2008) - [j8]Sheldon H. Jacobson
, Edward C. Sewell:
Application of Information Technology: A Web-based Tool for Designing Vaccine Formularies for Childhood Immunization in the United States. J. Am. Medical Informatics Assoc. 15(5): 611-619 (2008) - 2003
- [j7]Edward C. Sewell, Sheldon H. Jacobson
:
Using an Integer Programming Model to Determine the Price of Combination Vaccines for Childhood Immunization. Ann. Oper. Res. 119(1-4): 261-284 (2003) - [j6]Darrall Henderson, Diane E. Vaughan, Sheldon H. Jacobson
, Ron R. Wakefield
, Edward C. Sewell:
Solving the shortest route cut and fill problem using simulated annealing. Eur. J. Oper. Res. 145(1): 72-84 (2003) - 2001
- [c3]Sheldon H. Jacobson, Edward C. Sewell, Bruce G. Weniger:
Using Monte Carlo simulation to assess the value of combination vaccines for pediatric immunization. WSC 2001: 1421-1428 - 2000
- [j5]Ashok Kumar, Sheldon H. Jacobson
, Edward C. Sewell:
Computational analysis of a flexible assembly system design problem. Eur. J. Oper. Res. 123(3): 453-472 (2000)
1990 – 1999
- 1998
- [j4]Edward C. Sewell:
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph. INFORMS J. Comput. 10(4): 438-447 (1998) - 1996
- [j3]Edward C. Sewell:
Binary integer programs with two variables per inequality. Math. Program. 75: 467-476 (1996) - 1995
- [j2]Edward C. Sewell, Leslie E. Trotter Jr.:
Stability critical graphs and ranks facets of the stable set polytope. Discret. Math. 147(1-3): 247-255 (1995) - 1993
- [j1]Edward C. Sewell, Leslie E. Trotter Jr.:
Stability Critical Graphs and Even Subdivisions of K4. J. Comb. Theory B 59(1): 74-84 (1993) - [c2]Edward C. Sewell:
An improved algorithm for exact graph coloring. Cliques, Coloring, and Satisfiability 1993: 359-373 - 1990
- [c1]Edward C. Sewell, Leslie E. Trotter Jr.:
Stability Critical Graphs and Even Subdivisions of K_4. IPCO 1990: 457-466
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint