Large-scale problems with quasi-block matrices

DOI10.1134/S1064230719040099zbMath1431.65059OpenAlexW2968397511WikidataQ127373616 ScholiaQ127373616MaRDI QIDQ2290827

V. Yu. Leonov, D. V. Lemtyuzhnikova

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)

Related Items (3)

Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Metric approach for finding approximate solutions of scheduling problems

Uses Software

• SCIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimax in transportation models with integral constraints. I
• Grid parallelizing of discrete optimization problems with quasi-block structure matrices
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices
• Minimax in transportation models with integral constraints. II
• Computing the Minimum Fill-In is NP-Complete
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

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