bkell@cmu.edu | |

Office | Wean Hall 6211 |

I am a fifth-year math Ph.D. student in the ACO Program 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 bin packing problem and the use of multivalued decision diagrams in constraint programming. I am working with Willem-Jan van Hoeve.

- 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.

Last updated 13 January 2014. Brian Kell <bkell@cmu.edu>