An algorithm to perform a complete right-hand-side parametrical analysis for a 0–1-integer linear programming problem

We designed and implemented an algorithm to solve the continuous right-hand side parametric 0–1-Integer Linear Programming (ILP) problem, that is to solve a family of 0–1-ILP problems in which the problems are related by having identical objective and matrix coefficients. Our algorithm works by choosing an appropriate finite sequence of non-parametric 0–1-Mixed Integer Linear Programming (MILP) problems in order to obtain a complete parametrical analysis. The algorithm may be implemented by using any software capable of solving MILP problems.