White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Balanced matrices

Conforti, M, Cornuejols, G and Vuskovic, K (2006) Balanced matrices. Discrete Applied Mathematics, 306 (19-20). 2411 - 2437 . ISSN 0166-218X

Full text available as:
[img]
Preview
Text
surveyFINAL.pdf
Available under licence : See the attached licence file.

Download (372Kb)

Abstract

A 0,±1 matrix is balanced if, in every submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of 4. This definition was introduced by Truemper and generalizes the notion of balanced 0,1 matrix introduced by Berge. In this tutorial, we survey what is currently known about these matrices: polyhedral results, combinatorial and structural theorems, and recognition algorithms.

Item Type: Article
Copyright, Publisher and Additional Information: © 2006, Elsevier. This is an author produced version of a paper published in Discrete Applied Mathematics. Uploaded in accordance with the publisher's self-archiving policy.
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 21 Jun 2012 14:51
Last Modified: 08 Jun 2014 18:55
Published Version: http://dx.doi.org/10.1016/j.disc.2005.12.033
Status: Published
Publisher: Elsevier for North-Holland Publishing
Identification Number: 10.1016/j.disc.2005.12.033
URI: http://eprints.whiterose.ac.uk/id/eprint/74351

Actions (repository staff only: login required)