Colorings of k-balanced matrices and integer decomposition property of related polyhedra

Authors:
Giacomo Zambelli
Affiliations:
Dipartimento di Matematica Pura e Applicata, Universitá di Padova, Via Belzoni 7, 35131 Padova, Italy
Venue:
Operations Research Letters
Year:
2007

Citing 3
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
From totally unimodular to balanced 0,±1 matrices: a family of integer polytopes

Mathematics of Operations Research
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices

SIAM Journal on Discrete Mathematics

Testing additive integrality gaps

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a class of polyhedra, arising from certain 0,1 matrices introduced by Truemper and Chandrasekaran, has the integer decomposition property. This is accomplished by proving certain coloring properties of these matrices.