Ideal 0, 1 Matrices

66Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We define a 0, 1 matrix M to be ideal if all vertices of the polyhedron { x: Mx ≥ 1, x ≥ 0 } have only 0, 1 components. We expand the list of known minor minimal nonideal matrices by several thousand. Many of these examples are obtainedpolyhedrally, by constructing new minimally nonideal matrices from old ones. We present a conjecture that might be viewed as the counterpart for ideal matrices of Berge′s strong perfect graph conjecture. We provide evidence for the conjecture bycompletely characterizing all minimally nonideal circulants. © 1994 Academic Press. All rights reserved.

Cite

CITATION STYLE

APA

Cornuejols, G., & Novick, B. (1994). Ideal 0, 1 Matrices. Journal of Combinatorial Theory, Series B, 60(1), 145–157. https://doi.org/10.1006/jctb.1994.1009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free