Patterns in JavaA tale of three patternsby Kevlin HenneyListing 1. Iteration over a sorted binary tree using recursive descent in an enumeration method.

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

Cutting Plane Methods: Iterative procedures that add valid inequalities (cuts) to eliminate non-integral solutions in a relaxed problem without removing any feasible integer solutions.

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.