Decomposition in multidimensional Boolean-optimization problems with sparse matrices

DOI10.1134/S1064230718010033zbMath1391.90413OpenAlexW2793320699MaRDI QIDQ1647455

D. V. Lemtyuzhnikova, D. V. Kovkov

Publication date: 26 June 2018

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230718010033

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (1)

Large-scale problems with quasi-block matrices

Uses Software

• Scotch
• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Sparse Matrix-Vector Multiplication on GPGPUs
• The Use of Linear Graphs in Gauss Elimination
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Modification of the minimum-degree algorithm by multiple elimination
• Computing the Minimum Fill-In is NP-Complete
• Sub-optimal control of sparsely coupled systems
• Algorithmic Aspects of Vertex Elimination on Graphs
• Improving the Run Time and Quality of Nested Dissection Ordering
• Robust Ordering of Sparse Matrices using Multisection
• High Dimensional Low Rank Plus Sparse Matrix Decomposition
• An Approximate Minimum Degree Ordering Algorithm
• Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
• Depth-First Search and Linear Graph Algorithms
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Decomposition in multidimensional Boolean-optimization problems with sparse matrices