Balanced matrices
From MaRDI portal
Publication:2433704
DOI10.1016/j.disc.2005.12.033zbMath1102.05013OpenAlexW2913095643WikidataQ57949070 ScholiaQ57949070MaRDI QIDQ2433704
Kristina Vušković, Michele Conforti, Cornuéjols, Gérard
Publication date: 30 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/74351/2/surveyFINAL.pdf
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)
Related Items
Oriented hypergraphs: balanceability, Properties of SLUR Formulae, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, Oriented hypergraphs: introduction and balance, On weighted efficient total domination, The multiple domination and limited packing problems in graphs, Non total-unimodularity neutralized simplicial complexes, Location routing problems on trees, The Multilinear Polytope for Acyclic Hypergraphs, Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra, About some UP-based polynomial fragments of SAT, Berge-acyclic multilinear 0-1 optimization problems, Balanced Cayley graphs and balanced planar graphs, A structure theorem for graphs with no cycle with a unique chord and its consequences, A characterization of oriented hypergraphic balance via signed weak walks, Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Linear Balanceable and Subcubic Balanceable Graphs*
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect \(0,\pm 1\) matrices
- Testing balancedness and perfection of linear matrices
- Concave extensions for nonlinear 0-1 maximization problems
- Probabilistic logic
- Strong unimodularity for matrices and hypergraphs
- Probabilistic satisfiability
- Totally balanced and totally unimodular matrices defined by center location problems
- Decomposition of regular matroids
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Structural properties and decomposition of linear balanced matrices
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- An edge-coloration theorem for bipartite graphs with applications
- Local unimodularity of matrix-vector pairs
- Balanced cycles and holes in bipartite graphs
- Resolution and the integrality of satisfiability problems
- Polynomial-time inference of all valid implications for Horn and related formulae
- On perfect \(0,\pm 1\) matrices
- \((0,\pm 1)\) ideal matrices
- On certain polytopes associated with graphs
- Decomposition of balanced matrices
- A theorem of Truemper
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Perfect matchings in balanced hypergraphs---a combinatorial approach
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Algorithmic aspects of clique-transversal and clique-independent sets
- Compositions for perfect graphs
- Good and nice colorings of balanced hypergraphs
- Anti-blocking polyhedra
- Normal hypergraphs and the perfect graph conjecture
- Perfect matchings in balanced hypergraphs
- A polynomial recognition algorithm for balanced matrices
- Combinatorial Optimization
- Perfect and Ideal 0, ±1 Matrices
- A Class of Balanced Matrices Arising from Location Problems
- Characterizations of totally balanced matrices
- On a Class of Totally Unimodular Matrices
- Totally-Balanced and Greedy Matrices
- Doubly Lexical Orderings of Matrices
- Structural properties and recognition of restricted and strongly unimodular matrices
- A Combinatorial Decomposition Theory
- On some characterisations of totally unimodular matrices
- Balanced matrices and property (G)
- On Finding Primal- and Dual-Optimal Bases
- Perfect Elimination and Chordal Bipartite Graphs
- From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
- Extended Horn sets in propositional logic
- A class of logic problems solvable by linear programming
- On Representatives of Subsets
- Characterization of Totally Unimodular Matrices
- Balanced matrices
