Accession Number:

ADA280021

Title:

Balanced Matrices

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s):

• Conforti, Michele
• Corneujols, Gerard
• Kapoor, Ajai
• Rao, M. R.
• Vuskovic, Kristina

Report Date:

1994-04-01

Pagination or Media Count:

45.0

Abstract:

A 0, or - 1 matrix A is balanced if, in every submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This definition was introduced by Truemper and generalizes the notion of balanced 0,1 matrix introduced by Berge. In this paper, we survey what is currently known about these matrices, including polyhedral results, structural theorems, recognition algorithms and the relation with some problems in logic.

Descriptors:

• *MATRICES(MATHEMATICS)
• ALGORITHMS
• MATHEMATICAL LOGIC
• COMBINATORIAL ANALYSIS
• THEOREMS

Subject Categories:

• Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE