Skip to content →

Talks I Have Given (or Abetted)

Exact method for flow-observability problems (with Monica Gentili). 16th INFORMS Computing Society Conference, Knoxville (TN), January 2019.

The Sensor Location Partial and Full Observability Problems consist in determining the best location of sensors on a network to allow partial or full observability of the network flows. We present the first exact algorithm to optimally solve both the problems. The approach is an implicit hitting set based algorithm which uses a novel formulation of the addressed problems able to overcome several limitations of the existing approaches.
Slides (PDF)

Implicit hitting set problems. University of Louisville INFORMS Student Chapter, Louisville (KY), April 2016.

The hitting set problem entails selecting a least cost collection of objects or entities from a predetermined list of options while meeting the requirement that at least one object is chosen from each of a finite number of sets (“circuits”). The implicit hitting set problem is a hitting set problem in which the available objects are known at the outset but some or all of the circuits can only be determined by testing potential solutions. In this talk, I define the hitting set and implicit hitting set problems, discuss their connection to the well known set covering problem, provide several examples of implicit hitting set problems, and point out some challenges solving them.
Handout (PDF)

Pro Bono Analytics. University of Louisville INFORMS Student Chapter, Louisville (KY), April 2016.

INFORMS, the preeminent professional society for operations research (and analytics?) in the United States has recently launched its Pro Bono Analytics initiative. In this talk, I outline the nature of the initiative and discuss the ways in which volunteers can be involved. Since the initiative is new, we as yet have very “war stories”, but we can draw on the experience of the two years old “Pro Bono O.R. in Third Sector” program by our sister institute, the United Kingdom’s Operational Research Society (ORS).
Handout (PDF)

Twitter for O.R. – microblogging to a wide audience. 2011 INFORMS Annual Meeting, Charlotte (NC), November 2011.
Combinatorial Benders cuts for the minimum toll booth problem (with Lihui Bai). 2007 Annual Meeting of the Decision Sciences Institute, Phoenix, November 2007.
Combinatorial Benders cuts for the minimum toll booth problem (with Lihui Bai). 2007 INFORMS Annual Meeting, Seattle, November 2007.
Supplier managed inventories (SMI) and supply chain power (with W. C. Benton). 2007 INFORMS Annual Meeting, Seattle, November 2007.
Writing publishable articles – editors speak up.
Panel session, 2004 Annual Meeting of the Decision Sciences Institute, Boston, November 2004.
Writing publishable articles – editors speak up.
Panel session, 2003 Annual Meeting of the Decision Sciences Institute, Washington, D.C., November 2003.
Web-delivered graded assignments in the MBA core statistics course.
2002 Annual Meeting of the Decision Sciences Institute, San Diego, November 2002.
Writing publishable articles – editors speak up.
Panel session, 2002 Annual Meeting of the Decision Sciences Institute, San Diego, November 2002.
You be the jury – a virtual tenure review.
Panel session/workshop, 2002 Annual Meeting of the Decision Sciences Institute, San Diego, November 2002.
Reviewing journal submissions – tips and guidelines for doing a high quality review.
Panel session, 2000 Annual Meeting of the Decision Sciences Institute, Orlando, November 2000.
Nontraditional approaches to classification and discrimination.
Panel session, 1995 Annual Meeting of the Decision Sciences Institute, Boston, November 1995.
Minimal tardiness scheduling of a single processor via genetic search (with Gary Ragatz).
1995 INFORMS Annual Meeting, New Orleans, 1995.
Jointly constrained order quantities with independent discounts.
Colloquium, College of Administrative Science, Ohio State University, October 1993.
Mathematical programming and alternative classification models.
Invited paper, Multicriterion Decision Making and Artificial Intelligence cluster, TIMS/ORSA Joint National Meeting, Orlando, April 1992.
Heuristic solution procedures for a mixed integer programming discriminant model.
Workshop on Mathematical Programming Models for Discriminant Analysis, University of Florida, April 1989.
Bias correction of Holt forecasts for series containing geometric trend.
Proceedings of the Annual Meeting of the Decision Sciences Institute, November 1988.
Time series analysis for changes in productivity: some problems (with John A Wagner III).
Proceedings of the Seventeenth Annual Meeting of the American Institute for Decision Sciences, November 1985.
Linear programming under uncertainty.
A colloquium sponsored by the Department of Statistics and Probability, Michigan State University, January 1983.
Implementation of a subgradient projection algorithm.
TIMS/ORSA Joint National Conference, Detroit, 1982.
Elements of nonlinear optimization.
A joint mathematics colloquium of General Motors Institute and the University of Michigan at Flint, February 1980.