![](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
David R. Morrison
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
Journal Articles
- 2016
- [j11]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) - [j10]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
- [j9]David R. Morrison, Susan E. Martonosi:
Characteristics of optimal solutions to the sensor location problem. Ann. Oper. Res. 226(1): 463-478 (2015) - [j8]Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson
:
Assigning Panels to Meeting Rooms at the National Science Foundation. Interfaces 45(6): 529-542 (2015) - 2014
- [j7]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) - [j6]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) - [j5]David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
:
Characteristics of the maximal independent set ZDD. J. Comb. Optim. 28(1): 121-139 (2014) - [j4]David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
:
An algorithm to solve the proportional network flow problem. Optim. Lett. 8(3): 801-809 (2014) - [j3]Jiayi Guo, David R. Morrison, Sheldon H. Jacobson
, Janet A. Jokela:
Complexity results for the basic residency scheduling problem. J. Sched. 17(3): 211-223 (2014) - 2013
- [j2]David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
:
A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network. INFORMS J. Comput. 25(1): 2-12 (2013) - 2012
- [j1]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)
Informal and Other Publications
- 2014
- [i2]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) - 2011
- [i1]David R. Morrison, Susan E. Martonosi:
Characteristics of Optimal Solutions to the Sensor Location Problem. CoRR abs/1106.0349 (2011)
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-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint