Decomposing Matrices into Blocks
DOI10.1137/S1052623497318682zbMATH Open1032.90523OpenAlexW2045734922MaRDI QIDQ4229489FDOQ4229489
Authors: Ralf Borndörfer, Alexander Martin, Carlos E. Ferreira 
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497318682
Recommendations
- scientific article; zbMATH DE number 709605
- A decomposition procedure for one class of block programming problems
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Décomposition en matrices graphiques de matrices en $\lbrace 0, 1, -1\rbrace $ : application à la résolution de programmes linéaires entiers
integer programmingcutting planespolyhedral combinatoricsmatrix decompositionblock structure of a sparse matrix
Computational methods for sparse matrices (65F50) Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Mixed integer programming (90C11)
Cited In (31)
- Exact algorithms for the vertex separator problem in graphs
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- Disconnecting graphs by removing vertices: a polyhedral approach
- A-priori upper bounds for the set covering problem
- Revisiting dynamic programming for finding optimal subtrees in trees
- High-multiplicity \(N\)-fold IP via configuration LP
- Décomposition en matrices graphiques de matrices en $\lbrace 0, 1, -1\rbrace $ : application à la résolution de programmes linéaires entiers
- Packing and partitioning orbitopes
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- Branching rules revisited
- Structure Detection in Mixed-Integer Programs
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Improving strong branching by domain propagation
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- A model-based approach and analysis for multi-period networks
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- A decomposition heuristic for mixed-integer supply chain problems
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- Block SOS decomposition
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- The \(k\)-separator problem: polyhedra, complexity and approximation results
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
- Political districting to minimize cut edges
Uses Software
This page was built for publication: Decomposing Matrices into Blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229489)
