Decomposition of Balanced Matrices. Part 1. Introduction

Abstract

This study concerns 0,1 matrices that do not contain a square submatrix of odd order with two ones per row and per column. Such matrices and called balanced. They were first introduced by Berge and we summarize here their relevance in combinatorial optimization.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1991
Accession Number
ADA247397

Entities

People

  • Gérard Cornuéjols
  • M. R. Rao
  • Michele Conforti

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Coverings
  • Decomposition
  • Heuristic Methods
  • Integrals
  • Linear Programming
  • New York
  • Notation
  • Optimization
  • Parachutes
  • Permutations
  • Polynomials
  • Recognition
  • Sequences
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Linear Algebra