Large-scale problems with quasi-block matrices

DOI10.1134/S1064230719040099MaRDI QIDQ2290827zbMATH OpenOpenAlexWikidataFDO

Authors D. V. Lemtyuzhnikova, V. Yu. Leonov

Publication date 29 January 2020

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

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

zbMATH Keywords

block-staircase structureblock-treelike structurequasi-block matricessparse large matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• Grid parallelizing of discrete optimization problems with quasi-block structure matrices
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices
• scientific article; zbMATH DE number 3922369
• scientific article; zbMATH DE number 3845341
• scientific article; zbMATH DE number 724217

Cites work

• Computing the Minimum Fill-In is NP-Complete
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices
• Grid parallelizing of discrete optimization problems with quasi-block structure matrices
• scientific article; zbMATH DE number 3864992 (Why is no real title available?)
• scientific article; zbMATH DE number 3811313 (Why is no real title available?)
• scientific article; zbMATH DE number 3663908 (Why is no real title available?)
• Minimax in transportation models with integral constraints. I
• Minimax in transportation models with integral constraints. II
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

Cited in

(6)

• Grid parallelizing of discrete optimization problems with quasi-block structure matrices
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices
• Metric approach for finding approximate solutions of scheduling problems
• A metric approach for scheduling problems with minimizing the maximum penalty
• scientific article; zbMATH DE number 5674690 (Why is no real title available?)
• Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Large-scale problems with quasi-block matrices

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