Some insight into characterizations of minimally nonideal matrices

DOI10.1007/S00186-007-0176-7zbMATH Open1149.90123OpenAlexW1983917778MaRDI QIDQ2483016FDOQ2483016

Authors: Gabriela R. Argiroffo, Silvia M. Bianchi, G. Nasini 

Publication date: 5 May 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-007-0176-7

Recommendations

• Lehman's forbidden minor characterization of ideal 0-1 matrices
• Ideal 0, 1 matrices
• Near-perfect matrices
• \((0,\pm 1)\) ideal matrices
• On the set covering polyhedron of circulant matrices

zbMATH Keywords

set covering polyhedra

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• Bottleneck extrema
• The matroids with the max-flow min-cut property
• A catalog of minimally nonideal matrices
• Combinatorial optimization. Packing and covering
• On the width—length inequality
• Title not available (Why is that?)
• Combinatorial designs and related systems
• Lehman's forbidden minor characterization of ideal 0-1 matrices
• On a certain class of nonideal clutters
• Title not available (Why is that?)

Cited In (5)

• \((0, \pm 1)\) ideal matrices
• Vertex adjacencies in the set covering polyhedron
• A new infinite family of minimally nonideal matrices
• Title not available (Why is that?)
• The nonidealness index of circulant matrices

This page was built for publication: Some insight into characterizations of minimally nonideal matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483016)