# Library

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
• 1995-1999  (4)
Material
Years
Year
Keywords
Language
• 1
Book
Title: Matrix Decomposition by Branch-and-Cut /; Preprint SC 97-14
Author: Borndörfer, Ralf
Year of publication: 1997
Pages: 12 S.
Series Statement: Preprint / Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 97-14
ISSN: 0933-7911
Type of Medium: Book
Language: English
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 2
Book
Title: Decomposing Matrices into Blocks /; Preprint SC 97-15
Author: Borndörfer, Ralf
Year of publication: 1997
Pages: 28 S.
Series Statement: Preprint / Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 97-15
ISSN: 0933-7911
Type of Medium: Book
Language: English
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 3
Unknown
Publication Date: 2020-03-09
Description: In this paper we investigate whether matrices arising from linear or integer programming problems can be decomposed into so-called {\em bordered block diagonal form}. More precisely, given some matrix $A$, we try to assign as many rows as possible to some number of blocks of limited size such that no two rows assigned to different blocks intersect in a common column. Bordered block diagonal form is desirable because it can guide and speed up the solution process for linear and integer programming problems. We show that various matrices from the %LP- and MIP-libraries \Netlib{} and MIPLIB can indeed be decomposed into this form by computing optimal decompositions or decompositions with proven quality. These computations are done with a branch-and-cut algorithm based on polyhedral investigations of the matrix decomposition problem.
Keywords: ddc:000
Language: English
Type: reportzib , doc-type:preprint
Format: application/postscript
Format: application/pdf
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
• 4
Unknown
Publication Date: 2020-08-05
Description: In this paper we investigate whether matrices arising from linear or integer programming problems can be decomposed into so-called {\em bordered block diagonal form}. More precisely, given some matrix $A$, we try to assign as many rows as possible to some number of blocks of limited size such that no two rows assigned to different blocks intersect in a common column. Bordered block diagonal form is desirable because it can guide and speed up the solution process for linear and integer programming problems. We show that various matrices from the LP- and MIP-libraries NETLIB and MITLIB can indeed be decomposed into this form by computing optimal decompositions or decompositions with proven quality. These computations are done with a branch-and-cut algorithm based on polyhedral investigations of the matrix decomposition problem. In practice, however, one would use heuristics to find a good decomposition. We present several heuristic ideas and test their performance. Finally, we investigate the usefulness of optimal matrix decompositions into bordered block diagonal form for integer programming by using such decompositions to guide the branching process in a branch-and-cut code for general mixed integer programs.
Keywords: ddc:000
Language: English
Type: reportzib , doc-type:preprint
Format: application/postscript
Format: application/postscript
Format: application/pdf
Library Location Call Number Volume/Issue/Year Availability
Others were also interested in ...
Close ⊗