| Article ID: | iaor19941866 |
| Country: | United States |
| Volume: | 19 |
| Issue: | 1 |
| Start Page Number: | 21 |
| End Page Number: | 23 |
| Publication Date: | Feb 1994 |
| Journal: | Mathematics of Operations Research |
| Authors: | Conforti Michele, Cornujols Grard, Truemper Klaus |
| Keywords: | programming: integer |
In this paper the authors introduce a family of integer polytopes and characterize them in terms of forbidden submatrices. The two extreme cases in this family arise when the constraint matrix is totally unimodular and balanced, respectively. This generalizes results of Truemper-Chandrasekaran and Conforti-Cornuéjols.