This document will serve as a simple example for using COIN/BCP to solve an integer linear program (ILP) using branch and price (BP). The problem we will focus on is the Axial Assignment Problem [2]. The descriptions in this paper are for illustrative purposes only and are not meant to be computationally efficient.