scientific article; zbMATH DE number 30950

MaRDI QIDQ3987196zbMATH OpenFDO

Authors Reinhardt Euler, A. R. Mahjoub

Publication date 28 June 1992

zbMATH Keywords

balanced matricesgraphsnecessary and sufficient conditions for balancednessset covering polytope

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of packing and covering (05B40) Boolean programming (90C09)

Recommendations

• Balanced matrices
• Balanced matrices
• Decomposition of balanced matrices
• A polynomial recognition algorithm for balanced matrices
• On minimal forbidden subgraph characterizations of balanced graphs

Cited in

(10)

• Structural properties and decomposition of linear balanced matrices
• Decomposition of balanced matrices
• Balanced minimum covers of a finite set
• A polynomial recognition algorithm for balanced matrices
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• Quasi balanced matrices — An addendum
• From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
• Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
• On minimal forbidden subgraph characterizations of balanced graphs
• Perfect, ideal and balanced matrices

This page was built for publication:

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