Decomposing Matrices into Blocks
From MaRDI portal
Publication:4229489
DOI10.1137/S1052623497318682zbMath1032.90523OpenAlexW2045734922MaRDI QIDQ4229489
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
integer programmingcutting planespolyhedral combinatoricsmatrix decompositionblock structure of a sparse matrix
Computational methods for sparse matrices (65F50) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A-priori upper bounds for the set covering problem, Branching rules revisited, Revisiting dynamic programming for finding optimal subtrees in trees, A model-based approach and analysis for multi-period networks, A branch-and-price algorithm for capacitated hypergraph vertex separation, A decomposition heuristic for mixed-integer supply chain problems, High-multiplicity \(N\)-fold IP via configuration LP, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, On integer and bilevel formulations for the \(k\)-vertex cut problem, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem, Packing and partitioning orbitopes, Structure Detection in Mixed-Integer Programs, Exact algorithms for the vertex separator problem in graphs, Disconnecting graphs by removing vertices: a polyhedral approach, New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation, Improving strong branching by domain propagation, Automatic Dantzig-Wolfe reformulation of mixed integer programs, Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, Political districting to minimize cut edges, Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming, The \(k\)-separator problem: polyhedra, complexity and approximation results
Uses Software
