Balanced matrices
From MaRDI portal
Publication:5659570
DOI10.1007/BF01584535zbMath0247.05126OpenAlexW4206780782MaRDI QIDQ5659570
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584535
Integer programming (90C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
A decomposition property of polyhedra, Balanced matrices with row sum 3, Dioïds and semirings: Links to fuzzy sets and other applications, Reliability, covering and balanced matrices, Convexity in Graphs and Hypergraphs, Permuting matrices to avoid forbidden submatrices, Resolution and the integrality of satisfiability problems, On the integer properties of scheduling set partitioning models, A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices, One-node cutsets and the dominating set polytope, Restricted coloring models for timetabling, Decomposition of wheel-and-parachute-free balanced bipartite graphs, Coverings and matchings in r-partite hypergraphs, Strong unimodularity for matrices and hypergraphs, Integer programming methods for large-scale practical classroom assignment problems, A generalization of a theorem of König, Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths, Transversal partitioning in balanced hypergraphs, Clique-perfectness and balancedness of some graph classes, Restrictions and preassignments in preemptive open shop scheduling, On the 0,1 facets of the set covering polytope, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, Covering, Packing and Generalized Perfection, Graph theoretic relaxations of set covering and set partitioning problems, On some graph classes related to perfect graphs: a survey, A Class of Balanced Matrices Arising from Location Problems, Deltas, extended odd holes and their blockers, Complement total unimodularity, Colouring bottomless rectangles and arborescences, Minimum degree conditions for tight Hamilton cycles, Making clusterings fairer by post-processing: algorithms, complexity results and experiments, On decompositions of a multi-graph into spanning subgraphs, Discrete extremal problems, Balanced matrices, Good and nice colorings of balanced hypergraphs, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, Quasi-balanced matrices, Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs, Strongly simplicial vertices of powers of trees, Properties of balanced and perfect matrices, Structural properties and decomposition of linear balanced matrices, On the mixed set covering, packing and partitioning polytope, Testing balancedness and perfection of linear matrices, Two classes of location problems on tree networks, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type, Improved approximations for guarding 1.5-dimensional terrains, The strong perfect graph conjecture holds for diamonded odd cycle-free graphs, Dominating set games., Unnamed Item, Perfect, ideal and balanced matrices, Balanced Cayley graphs and balanced planar graphs, On minimal forbidden subgraph characterizations of balanced graphs, A note on the total unimodularity of matrices, Classification de certaines matrices 0-1, Local unimodularity of matrix-vector pairs, On some characterisations of totally unimodular matrices, A min-max relation for the partial q-colourings of a graph. II: Box perfection, Optimisation and hypergraph theory, On minimal forbidden subgraph characterizations of balanced graphs, Extensions of coloring models for scheduling purposes, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis, Odd cycles and matrices with integrality properties, On testing consecutive-ones property in parallel, Decomposition of balanced matrices, Resistant Sets in the Unit Hypercube, A polynomial recognition algorithm for balanced matrices, Domination, independent domination, and duality in strongly chordal graphs, Extensions of the Minimum Dominating Set Problem, Balanced \(0,\pm 1\) matrices. I: Decomposition, Total weak unimodularity: Testing and applications, Recognizing balanceable matrices, On balanced graphs, The domatic number problem on some perfect graph families, Perfect zero–one matrices, An exact algorithm for multiple depot bus scheduling, Totally-Balanced and Greedy Matrices, Idealness of \(k\)-wise intersecting families
Cites Work
