David Hartvigsen

Professor of Management and
Administrative Sciences

University of Notre Dame

Basic info:

Office: 354 Mendoza College of Business
Office Hours: By appointment
Phone: (574) 631-9470
Fax: (574) 631-5255
e-mail: David.Hartvigsen.1@nd.edu
snail-mail:

University of Notre Dame
354 Mendoza College of Business
Notre Dame, IN 46556-5646

Courses recently taught at Notre Dame:

Operations Management (Executive MBA)
Statistics for Managers (Executive MBA)
Spreadsheet Decision Modeling (MBA and Undergraduate)

Check out my Web site:

Operations Management Software

Check out my book:

SimQuick: Process Simulation with Excel, Second Edition

Students interested in quantitative methods: Check out INFORMS OR/MS Resource Collection and The Science of Better. These sites have lots of information about job opportunities and how quantitative methods are used in the real world.

Research interests:

Operations Research
Combinatorial Optimization
Network Flows
Integer Programming
Graph Theory

Education:

Ph.D. Mathematics; Carnegie Mellon University; 1984
M.S. Mathematics; Carnegie Mellon University; 1980
B.A. Mathematics; Colgate University; 1979

Consulting:

Pfizer Pharmaceuticals
Moore Corporation Limited
Rand McNally
National Steel
Whirlpool

Recent publications:

Hartvigsen, D. (1993) "Minimum Path Bases." Journal of Algorithms 15, 125-142.
Hartvigsen, D., Mardon, R. (1993) "When Do Short Cycles Generate the Cycle Space?" Journal of Combinatorial Theory, Series B 57, No. 1, 88-99.
Hartvigsen, D., Mardon, R. (Aug. 1994) "The All-pairs Min-cut Problem and the Min Cycle Basis Problem on Planar Graphs." SIAM Journal on Discrete Math. 7, No. 3.
Hartvigsen, D., Pulleyblank, W.R. (1994) "Outer-facial Graphs and the Traveling Salesman Problem." SIAM Journal on Optimization 4, No. 3, 676-689.
Hartvigsen, D., Margot, F. (1995) "Multi-terminal Flows and Cuts." Operations Research Letters 17, 201-204.
Hartvigsen, D. (1995) "Generalizing the All-pairs Min Cut Problem." Discrete Math. 147, 151-169.
Hartvigsen, D. (1995) "Generalized Max Flows and Augmenting Paths (Short version)." Proceedings of the 4th International Integer Programming and Combinatorial Optimization Conference, Springer 185-197.
Hartvigsen, D. (1996) "A Submodular Optimization Problem with Side Constraints (Short version)." Proceedings of the 5th International Integer Programming and Combinatorial Optimization Conference, Springer 249-259.
Hartvigsen, D., (Dec./Jan.1998) "Using the Web in the Teaching of OM." Decision Line, 13-14. (see http://dsi.gsu.edu/).
Hartvigsen, D. (1998) "The Planar Multiterminal Cut Problem." Discrete Applied Math. V. 85, 203-222.
Hartvigsen, D. (1999) "Operations Management Software," on the Web site of Addison Wesley Longman, Inc. as a supplement to Operations Management, Fifth Edition (1999) by Krajewski and Ritzman.
Hartvigsen, D. (August 1998) "A Submodular Optimization Problem with Side Constraints (Full version)." Math. of OR V. 23, No. 3, 661-679.
Hartvigsen, D., Wei, J., R. Czuchlewski, "The Conference Paper Assignment Problem." Decision Sciences Journal V. 30, No. 3 (Summer 1999) 865-876.
Easley, R.F., Hartvigsen, D. "Crossing Properties of Multiterminal Cuts." Networks V. 34, No. 3 (October 1999) 215-220
Hartvigsen, D. (1999) "The Square-free 2-factor Problem in Bipartite Graphs (Short version)." Proceedings of the 7th International Integer Programming and Combinatorial Optimization Conference, Springer.
Hartvigsen, D. "SimQuick: Process Simulation with Excel" (educational booklet plus software package). Prentice Hall (2001).
Hartvigsen, D. "A Strongly Polynomial Time Algorithm for a Constrained Submodular Optimization Problem." Discrete Applied Math.V. 113 (2-3) (2001) 183-194.
Hartvigsen, D. "Compact Representations of Cuts." SIAM Journal on Discrete Math. V. 14, No. 1 (2001) 49-66.
Hartvigsen, D. "Characterizing the Flow Equivalent Trees of a Network." Discrete Applied Math.V. 128, No. 2-3 (2003) 387-394.
Hartvigsen, D. "SimQuick: Process Simulation with Excel, 2nd Edition" (educational booklet plus software package). Prentice Hall (2004).
Hartvigsen, D. Review of text: "Graphs, Networks and Algorithms" by Dieter Jungnickel (Springer, 2002), Operations Research Letters V. 32, No. 4 (July 2004) 391-392.
Hartvigsen, D. “1-restricted Simple 2-matchings (extended abstract),” in Electronic Notes in Discrete Mathematics, Vol 18, Elsevier (2004) 145-149.
Hartvigsen, D. "Representing the Strengths and Directions of Pairwise Comparisons," Eur. Journal of Operational Research. V. 163:2 (June 1, 2005) 357-369.
Hartvigsen, D. "The S-digraph Optimization Problem and the Greedy Algorithm," Discrete Optimization. V. 2:4 (December 2005) 320-334.
Hartvigsen, D. "Finding Maximum Square-free 2-matchings in Bipartite Graphs," J. of Comb. Theory, B. V. 96 (2006) 693-705.
Hartvigsen, D., Hell, P., and Szabo, J. "The k-piece Packing Problem," J. of Graph Theory. V. 52, Issue 4 (August 2006) 267-293.
Hartvigsen, D. "Vote Trading in Public Elections," Mathematical Social Sciences. 52:1 (July 2006) 31-48. Update
Hartvigsen, D., Li, Y. "Triangle-free Simple 2-matchings in Subcubic Graphs (extended abstract)," Proceedings of the 12th International Integer Programming and Combinatorial Optimization Conference, Eds.: M. Fischetti and D.P. Williamson, Springer, Lecture Notes in Computer Science 4513, Berlin (2007) 43-52.
Hartvigsen, D. "Maximum Cardinality 1-Restricted Simple 2-Matchings," Electronic J. of Combinatorics 14 (2007), #R73.
Hartvigsen, D. "The Manipulation of Voting Systems," Journal of Business Ethics, V. 80, No. 1 (June 2008) 13-21.
Hartvigsen, D., Li, Y. "Polyhedral Results for 1-restricted Simple 2-matchings," to appear in SIAM Journal on Optimization.

Working papers:

Hartvigsen, D. "Generalized Max Flows and Augmenting Paths."
Hartvigsen, D., Li, Y. “Polyhedron of Triangle-Free Simple 2-matchings in Subcubic Graphs.”
Hartvigsen, D. “The Action Gambler and Equal-Sized Wagering.”

For the brave, here is a copy of my thesis in pdf format. It contains an algorithm for finding maximum cardinality triangle-free simple 2-matchings: