Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
From MaRDI portal
Publication:5640988
DOI10.1287/mnsc.18.1.98zbMath0232.90023OpenAlexW2111012041MaRDI QIDQ5640988
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
Related Items
Graph Theoretic Methods for the Qualitative Analysis of Rectangular Matrices, A model-based approach and analysis for multi-period networks, Class of optimization algorithms for the solution of large nonlinear programming problems. II, High-multiplicity \(N\)-fold IP via configuration LP, Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition, Structure Detection in Mixed-Integer Programs, Constructing blockmodels: how and why, Automatic Dantzig-Wolfe reformulation of mixed integer programs, Identification of special structure constraints in linear programs, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
