Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • Treffer 7 von 41
Zurück zur Trefferliste

Matrix Decomposition by Branch-and-Cut

Zitieren Sie bitte immer diese URN: urn:nbn:de:0297-zib-2839
  • 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.

Volltext Dateien herunterladen

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Ralf BorndörferORCiD, Carlos E. Ferreira, Alexander Martin
Dokumentart:ZIB-Report
Datum der Erstveröffentlichung:17.03.1997
Schriftenreihe (Bandnummer):ZIB-Report (SC-97-14)
ZIB-Reportnummer:SC-97-14
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.