From Totally Unimodular to Balanced O, +-1 Matrices: A Family of Integer Polytopes,

Abstract

In this paper we 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- Cornuejols.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 07, 1992
Accession Number
ADA254552

Entities

People

  • Gwrard Cornuwjols
  • Klaus Truemper
  • Michele Conforti

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Inequalities
  • Integer Programming
  • Integrals
  • Linear Programming
  • Mathematics
  • Pennsylvania
  • Reasoning
  • Schools
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Linear Algebra