A linear algorithm for integer programming in the plane

TL;DR: An algorithm to separate over the convex hull of a mixed integer knapsack set which exploits dominance relationships is developed, and its computations, which are performed in exact arithmetic, are surprising: In the vast majority of the instances in whichknapsack cuts yield bound improvements, MIR cuts alone achieve over 87% of the observed gain.

TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.