David Hartvigsen


David  Hartvigsen

Contact Information


David Hartvigsen received a Ph.D. in Mathematics from Carnegie Mellon University in 1984. After eight years on the faculty of the Kellogg Graduate School of Management at Northwestern University, he joined the Mendoza College of Business in 1993. His research interests are in the field of Operations Research where he develops algorithms for the efficient operation of complex networks. His work has appeared in a variety of mathematics and operations research journals. For many years, Professor Hartvigsen taught Operations Management to traditional MBAs, executive MBAs, and undergraduate business majors. He currently teaches Statistics to executive MBAs and a course called Spreadsheet Decision Modeling to traditional MBAs. Professor Hartvigsen has published a book and software package, called SimQuick, that allows the user to model and improve the efficiency of processes using simulation in Excel spreadsheets. Professor Hartvigsen served as Chairman of the Management Department from 2012-2015. His current home, the Information Technology, Analytics, and Operations Department, split from the Management Department in 2016.

Areas of Expertise


Operations Research


Ph D, Carnegie-Mellon University

MS, Carnegie-Mellon University

BA, Colgate University


"Packing k-matchings and k-critical Graphs", to appear in SIAM Journal on Discrete Mathematics.

"Fingering Systems for Electronic Musical Instruments", Mathematics and Music, 8, 2014.

"Polyhedron of Triangle-free Simple 2-matchings in Subcubic Graphs", (with Yanjun Li), Mathematical Programming, 138, 2013.

"Maximum Cardinality Simple 2-matchings in Subcubic Graphs", (with Yanjun Li), SIAM Journal on Optimization, 21, 2011.

"Neighbor Systems and the Greedy Algorithm", SIAM Journal on Discrete Mathematics, 24, 2010.

"Optimal Electronic Musical Instruments", European Journal of Operational Research, 206, 2010.

"The Action Gambler and Equal-sized Wagering", Journal of Applied Probability, 46, 2009.

"Polyhedral Results for 1-restricted Simple 2-matchings", (with Yanjun Li), SIAM Journal on Optimization, 19, 2008.

"The Manipulation of Voting Systems", Journal of Business Ethics, 80, 2008.

"Maximum Cardinality 1-Restricted Simple 2-Matchings", Electronic Journal of Combinatorics, 14, 2007.

"Finding Square-free 2-matchings in Bipartite Graphs", Journal of Combinatorial Theory, Series B, 96, 2006.

"The k-piece Packing Problem", (with Pavol Hell, Jacint Szabo), Journal of Graph Theory, 52, 2006.

"Vote Trading in Public Elections", Mathematical Social Sciences, 52, 2006.

"The S-digraph Optimization Problem and the Greedy Algorithm", Discrete Optimization, 2, 2005.

"Representing the Strengths and Directions of Pairwise Comparisons", European Journal of Operational Research, 163, 2005.

"Characterizing the Flow Equivalent Trees of a Network", Discrete Applied Mathematics, 128, 2003.

"A Strongly Polynomial Time Algorithm for a Constrained Submodular Optimization Problem", Discrete Applied Mathematics, 113, 2001.

"Compact Representations of Cuts", SIAM Journal on Discrete Mathematics, 14, 2001.

"Crossing Properties of Multiterminal Cuts", (with R. Easley), Networks, 34(3), 1999.

"The Conference Paper-Reviewer Assignment Problem", (with J. Wei, R. Czuchlewski), Decision Sciences Journal, 30(3), 1999.

"The Square-free 2-factor Problem in Bipartite Graphs (extended abstract)", Proceedings of the 7th International Integer Programming and Combinatorial Optimization Conference, Springer, 1999.

"The Planar Multiterminal Cut Problem", Discrete Applied Mathematics, 85, 1998.

"The Submodular Optimization Problem with Side Constraints", Mathematics of Operations Research, 23(3), 1998.


"SimQuick: Process Simulation with Excel, 3rd Edition (updated 6/15/16)", Create Space (at Amazon.com), January (1st Quarter/Winter) 2016

"SimQuick: Process Simulation with Excel, 2nd Edition", Prentice Hall, 2004

"SimQuick: Process Simulation with Excel", Prentice Hall, 2001


20th Mathematical Programming Symposium, "Triangle-free 2-matchings in Subcubic Graphs" (August 2009).

RIMS Conference on Comb. Opt. and Disc. Algorithms, "Neighbor Systems and the Greedy Algorithm" (June 2008).

INFORMS Conference, "Polyhedral results for 1-restricted simple 2-matchings" (November 2007).

Integer Programming and Combinatorial Optimization Symposium, "Triangle-free Simple 2-matchings in Subcubic Graphs" (June 2007).

Mathematics Department, McGill University, "A Greedy Algorithm for Multi-jump Systems" (February 2007).

19th Mathematical Programming Symposium, "Edge-free Simple 2-matchings in Trees" (August 2006).

American Mathematical Society, Central Region Meeting, "Recent Developments in Matching Theory" (April 2006).

International Fed. of Operations Research Societies, "Maximum 1-restricted Simple 2-matchings" ( 2005).

Operations Seminar, "Optimal Vote Trading" ( 2005).

Latin-American Conference on Combinatorics, Graphs and Applications, "The 1-restricted Simple 2-matching Problem" ( 2004).

EUROCOMB '03, "The k-piece Packing Problem" ( 2003).

IFORS Conference, Edinburgh, Scotland, "A Generalized Greedy Algorithm" ( 2002).

INFORMS Conference, San Jose, "SimQuick: Process Simulation with Excel" ( 2002).

Integer Programming Conference in Honor of Egon Balas, Carnegie Mellon University, "A Greedy Algorithm for Multi-jump Systems" ( 2002).

INFORMS Conference, Hawaii, "Representing the Strengths and Directions of Pairwise Comparisons" ( 2001).

INFORMS Conference, Miami, "The k-piece Packing Problem (with P. Hell)" ( 2001).

17th Mathematical Programming Symposium, Atlanta, "The k-piece Packing Problem (with P. Hell)" ( 2000).

INFORMS Conference, San Antonio, "Process Simulation in Excel with SimQuick" ( 2000).

Conference on Matchings, Matroids, and Extensions, University of Waterloo, "Finding a Square-free 2-factor in a Bipartite Graph" ( 1999).

INFORMS Conference, Philadelphia, "Characterizing the Flow Equivalent Trees of a Network" ( 1999).

Integer Programming and Combinatorial Optimization Symposium, Graz, Austria, "The Square-free 2-factor Problem in Bipartite Graphs" ( 1999).

Northwestern University, Operations Seminar, "A Relaxation of the Hamilton Tour Problem" ( 1999).

Production and Operations Management Society Conference, Charleston, SC, "The Conference Paper Assignment Problem" ( 1999).

Asia Pacific Decision Sciences Institute Annual Meeting, "The Conference Paper Assignment Problem" ( 1998).

INFORMS Conference, Montreal, "Crossing Properties of Multiterminal Cuts" ( 1998).

INFORMS Conference, Seattle, "The Multi-commodity Cut Problem" ( 1998).