In a recent issue of this journal, Proll presented a graph partitioning problem to illustrate how tighter formulations of integer linear programs (ILP) result in reduced computational effort. This paper presents a large number of other problems where tighter formulations of the associated ILPs lead to similar benefits thus providing a more comprehensive framework for discussing ILP formulations in industrial engineering and mathematical modelling courses.