Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms

DOI10.1287/MNSC.18.1.98MaRDI QIDQ5640988zbMATH OpenOpenAlexFDO

Authors Roman L. Weil, Paul C. Kettler

Publication date 1971

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.18.1.98

Mathematics Subject Classification ID

Decomposition methods (49M27) Linear programming (90C05)

Cited in

(12)

• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Constructing blockmodels: how and why
• A decomposition-based approach for the multiperiod multiproduct distribution planning problem
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• A model-based approach and analysis for multi-period networks
• Identification of special structure constraints in linear programs
• Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices
• Class of optimization algorithms for the solution of large nonlinear programming problems. II
• Structure Detection in Mixed-Integer Programs
• Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
• High-multiplicity \(N\)-fold IP via configuration LP
• Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

This page was built for publication: Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640988)