Decomposing Matrices into Blocks

  title={Decomposing Matrices into Blocks},
  author={Ralf Bornd{\"o}rfer and Carlos Eduardo Ferreira and Alexander Martin},
  journal={SIAM J. Optim.},
In this paper we investigate whether matrices arising from linear or integer programming problems can be decomposed into so-called bordered block diagonal form. More precisely, given some matrix A, we try to assign as many rows as possible to some number $\beta$ of blocks of size $\kappa$ such that no two rows assigned to different blocks intersect in a common column. Bordered block diagonal form is desirable because it can guide and speed up the solution process for linear and integer… 

Figures and Tables from this paper

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time

It is shown that block-structured linear programming can be solved efficiently via an adaptation of a parametric search framework by Norton, Plotkin, and Tardos in combination with Megiddo's multidimensional search technique.

Models and algorithms for decomposition problems

This thesis deals with the k-Vertex Cut problem, that is the problem of finding the minimum subset of nodes whose removal disconnects a graph into at least k components, and it models relevant applications in matrix decomposition for solving systems of equations by parallel computing.

Packing and partitioning orbitopes

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which

Automatic decomposition of mixed integer programs for lagrangian relaxation using a multiobjective approach

This paper presents a new method to automatically decompose general Mixed Integer Programs (MIPs). To do so, we represent the constraint matrix for a general MIP problem as a hypergraph and relax

Exploiting structure in integer programs

The thesis argues the case for exploiting certain structures in integer linear programs, based on augmented Lagrangian methods for novel semidefinite programming relaxations, and reformulations based on a novel transformation of graph colouring to graph multicolouring.

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs

Borders on the ratio of $z^{cut}$ and the optimal objective function value of the MILP that depends only on the sparsity structure of the constraint matrix and the support of sparse cuts selected are presented, that is, these bounds are completely data independent.

A branch-and-price algorithm for capacitated hypergraph vertex separation

We exactly solve the $${\mathcal {NP}}$$ NP -hard combinatorial optimization problem of finding a minimum cardinality vertex separator with k (or arbitrarily many) capacitated shores in a hypergraph.

Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming

It is shown that integer programs with n variables and a constraint matrix with tree-depth d and largest entry Δ are solvable in time g(d,Δ) poly(n) for some function g, i.e., fixed parameter tractable when parameterized by tree- depth d and Δ.

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

This work designs a parameterized algorithm that constructs a matrix equivalent to an input matrix A that has small primal/dual tree-depth and entry complexity if such an equivalent matrix exists and provides structural results characterizing the existence of a sparse equivalent matrix in terms of the structural properties of the associated column matroid.

The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation




Sparse Matrix Ordering Methods for Interior Point Linear Programming

A new method, based on the nested dissection heuristic, provides significantly better orderings than the most commonly used ordering method, minimum degree, on a variety of large-scale linear programming problems.

The node capacitated graph partitioning problem: A computational study

A variety of separation heuristics for cycle, cycle with ears, knapsack tree and path-block cycle inequalities among others are presented and a formulation including variables for the edges with nonzero costs and node partition variables is presented.

Solving Multiple Knapsack Problems by Cutting Planes

The inequalities that are described here serve as the theoretical basis for a cutting plane algorithm that is applied to practical problem instances arising in the design of main frame computers, in the layout of electronic circuits, and in sugar cane alcohol production.

Theory of linear and integer programming

  • A. Schrijver
  • Mathematics
    Wiley-Interscience series in discrete mathematics and optimization
  • 1999
Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear


It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph, which can be used to compute good separators in grid graphs.

Parallel Algorithms for Matrix Computations

This book consists of two comprehensive survey papers on important parallel algorithms for solving problems arising in the major areas of numerical linear algebra — direct solution of linear systems, least squares computations, eigenvalue and singular value Computations, and rapid elliptic solvers.

Geometric Algorithms and Combinatorial Optimization

0. Mathematical Preliminaries.- 0.1 Linear Algebra and Linear Programming.- Basic Notation.- Hulls, Independence, Dimension.- Eigenvalues, Positive Definite Matrices.- Vector Norms, Balls.- Matrix

Facets and lifting procedures for the set covering polytope

The strong connections between several combinatorial problems and the covering problem are pointed out and, exploiting those connections, some examples are presented of new facets for the Knapsack and Acyclic Subdigraph polytopes.

Packing Steiner trees: a cutting plane algorithm and computational results

This paper uses a cutting plane algorithm based on the polyhedral theory for the Steiner tree packing polyhedron to solve some switchbox routing problems of VLSI-design and reports on the computational experience.

On the facial structure of set packing polyhedra

This paper shows that the cliques of the intersection graph provide a first set of facets for the polyhedron in question, and it is shown that the cycles without chords of odd length of the intersections graph give rise to a further set of facet.