Abstract
In this work, we investigate parametric probing methods based on solution cardinality for set partitioning problems. The methods used are inspired by the early work of Gass and Saaty on the parametric solution to linear programs, as well as the later work of Joseph, Gass, and Bryson that examined the duality gap between the integer and relaxation solutions to general integer programming problems. Computational results are presented for a collection of set partitioning problems found in the literature.