Publications, Presentations, and Posters
- Load Testing Apache Mesos.
David R. Morrison,
MesosCon,
November 2018.
- Getting the Most out of your Mesos.
David R. Morrison,
LISA,
October 2018.
- Autoscaling and Simulation for Yelp's Distributed Systems.
David R. Morrison,
INFORMS Business Analytics Conference,
May 2018.
- Super-charging DevOps with Analytics.
David R. Morrison,
INFORMS Business Analytics Conference,
April 2017.
- Lessons Learned from a Year of Using Spot Fleet.
Chunky Gupta and David R. Morrison,
AWS re:Invent,
December 2016.
- Branch-and-Bound Algorithms: Recent Advances in Searching, Branching, and Pruning.
David R. Morrison, Sheldon H. Jacobson, Jason J. Sauppe, Edward E. Sewell,
Discrete Optimization, 17:79-102,
February 2016.
- Assigning Panels to Meeting Rooms at the National Science Foundation.
Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson,
Interfaces, 45(6):529-542,
December 2015.
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring using Zero-Suppressed Binary Decision Diagrams.
David R. Morrison, Edward C. Sewell, and Sheldon H. Jacobson,
Accepted for Publication, INFORMS Journal on Computing,
July 2015.
(Presented at the International Symposium for Mathematical Programming 2015)
- Characteristics of the Maximal Independent Set ZDD.
David R. Morrison, Edward C. Sewell, and Sheldon H. Jacobson,
Journal of Combinatorial Optimization, 28(1):121-139,
July 2014.
(The final publication is available at http://link.springer.com/article/10.1007%2Fs10878-014-9722-4 DOI: 10.1007/s10878-014-9722-4; presented at INFORMS 2014)
- An Application of the Branch, Bound, and Remember Algorithm to a New Simple Assembly Line Balancing Dataset.
David R. Morrison, Edward C. Sewell, and Sheldon H. Jacobson,
European Journal of Operational Research, 236(2):403-409,
July 2014.
(The final publication is available at http://dx.doi.org/10.1016/j.ejor.2013.11.033)
- Characteristics of Optimal Solutions to the Sensor Location Problem.
David R. Morrison and Susan E. Martonosi,
Annals of Operations Research,
June 2014.
(The final publication is available at http://link.springer.com/article/10.1007%2Fs10479-014-1638-y)
- Complexity Results for the Basic Residency Scheduling Problem.
Jiayi Guo, David R. Morrison, Sheldon H. Jacobson, and Janet A. Jokela,
Journal of Scheduling, 17(3):211-223,
June 2014.
(The final publication is available at http://link.springer.com/article/10.1007%2Fs10951-013-0362-9 DOI: 10.1007/s10951-013-0362-9)
- A Wide Branching Algorithm for the Graph Coloring Problem.
David R. Morrison, Jason J. Sauppe, Edward C. Sewell, and Sheldon H. Jacobson,
INFORMS Journal on Computing, 26(4):704-717,
May 2014.
(Presented at INFORMS 2012 and the INFORMS Computing Society meetings 2013)
- New Methods for Branch-and-Bound Algorithms.
David R. Morrison,
Dissertation, University of Illinois, Urbana-Champaign,
April 2014.
- Annual Rotation Schedules in 45 Seconds: Simplifying Life for an Internal Medicine Residency Program.
David R. Morrison, J. Taylor Fairbank, Sheldon H. Jacobson, Janet A. Jokela, MD, MPH,
APDIM Spring Conference Poster Session,
April 2014.
(First place in research poster competition)
- An Algorithm to Solve the Proportional Network Flow Problem.
David R. Morrison, Jason J. Sauppe, and Sheldon H. Jacobson,
Optimization Letters, 8(3):801-809,
March 2014.
(The final publication is available at http://link.springer.com/article/10.1007%2Fs11590-013-0634-5 DOI: 10.1007/s11590-013-0634-5)
- Using Zero-Suppressed Binary Decision Diagrams to Solve the Pricing Problem in Branch-and-Price Algorithms.
David R. Morrison, Edward C. Sewell, and Sheldon H. Jacobson,
INFORMS 2013 Annual Meeting,
October 2013.
- Internal Medicine Residency Scheduling at the University of Illinois, Urbana-Champaign College of Medicine.
David R. Morrison, J. Taylor Fairbank, Edward C. Sewell, and Sheldon H. Jacobson,
INFORMS 2013 Annual Meeting,
October 2013.
(Selected as a finalist for the Doing Good with Good OR student competition)
- A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network.
David R. Morrison, Jason J. Sauppe, and Sheldon H. Jacobson,
INFORMS Journal on Computing, 25(1):2-12,
Winter 2013.
(Presented at INFORMS 2011. Winner of the Best Group Presentation award at the UIUC Grad Expo 2011, sponsored by Facebook.)
- A BB&R Algorithm for Minimizing Total Tardiness on a Single Machine with Sequence Dependent Setup Times.
Edward C. Sewell, Jason J. Sauppe, David R. Morrison, Sheldon H. Jacobson, Gio K. Kao,
Journal of Global Optimization,
November 2012.
- The Pseudoflow Algorithm for the Maximum Blocking-Cut and Minimum-Waste Flow Problems.
David R. Morrison,
UIUC Qualifying Exam,
June 2011.
- Where are all the cars? Characteristics of Optimal Solutions to the Sensor Location Problem.
David R. Morrison and Susan Martonosi,
INFORMS 2008 Annual Meeting ,
October 2008.
- Taking the Mystery out of Sudoku Difficulty: An Oracular Model.
Sarah Fletcher, Frederick Johnson, David R. Morrison,
UMAP Journal of Undergraduate Mathematics and its Applications,
Fall 2008.
- Characteristics of Optimal Solutions to the Sensor Location Problem.
David R. Morrison,
Harvey Mudd College Senior Thesis,
May 2008.
(Winner of the Chavin prize for exceptional writing. Presented at the 2008 Joint Math Meetings Undergraduate Poster Session.)
- Blues for Gary: Design Abstractions for a Jazz Improvisation Assistant.
Robert Keller, Martin Hunt, Stephen Jones, David Morrison, and Steven Gomez,
Electronic Notes in Theoretical Computer Science,
November 2007.
HomeOlder...
