bkell@cmu.edu | |

Office | Wean Hall 6211 |

Office hours | Summer 2015: Monday through Friday, 12:30–1:30 and 3:00–4:00, or by appointment. |

I received my Ph.D. in Algorithms, Combinatorics, and Optimization in May 2015 through the Department of Mathematical Sciences at Carnegie Mellon University. I received my B.S. in mathematics and computer science from the University of Nebraska in 2006 and my M.S. in mathematics there in 2009.

I am interested in combinatorial optimization, constraint programming, and algorithms on graphs and networks. I am currently working on the use of multivalued decision diagrams for solving the Boolean satisfiability problem. I am working with Willem-Jan van Hoeve.

- Summer 2015: 21-470 Combinatorial Optimization, part of the Summer Undergraduate Applied Mathematics Institute (SUAMI).
- Spring 2015: recitations for 21-122 Integration and Approximation. See the recitation home page.
- Fall 2014: recitations for 21-257 Models and Methods for Optimization. See the recitation home page.
- Fall 2013: recitations for 21-257 Models and Methods for Optimization. Pivot a simplex tableau.
- Summer 2013: Calculus, Summer College Preview Program, Carnegie Mellon University Qatar.
- Fall 2012: recitations for 21-241 Matrices & Linear Transformations.
- Spring 2012: recitations for 21-112 Calculus II. File available: steps for optimization problems.
- Fall 2011: recitations for 21-122 Integration, Differential Equations, and Approximation. See the recitation home page.
- Spring 2011: recitations for 21-257 Models and Methods for Optimization.
- Spring 2010: 21-110 Problem Solving in Recreational Mathematics.
- Fall 2009, recitations for 21-121 Integration and Differential Equations. Files available: Chapter 2 review, problem 77; L’Hôpital’s rule practice problems.

- Optimal alphabetical order
- u13-old.pdf: some notes about martingales
- Questions from CMU ACO/OM/OR qualifying exams, 1980–2014 (PDF, 23.4 MB)
- Multidimensional bin packing
instances: 6 dimensions, 18 items, 6 bins. The instances
are named 6-18-6-
`β`_`n`, where`β`is the percentage bin slack and`n`is a sequential number to distinguish instances with identical parameters. - Notes from 21-701 Discrete Mathematics, spring 2009 (PDF, 34.3 MB)

Last updated 27 July 2015. Brian Kell <bkell@cmu.edu>