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

Improving relaxations for potential-driven network flow problems via acyclic flow orientations

Zitieren Sie bitte immer diese URN: urn:nbn:de:0297-zib-69622
  • The class of potential-driven network flow problems provides important models for a range of infrastructure networks. For real-world applications, they need to be combined with integer models for switching certain network elements, giving rise to hard-to-solve MINLPs. We observe that on large-scale real-world meshed networks the usually employed relaxations are rather weak due to cycles in the network. We propose acyclic flow orientations as a combinatorial relaxation of feasible solutions of potential-driven flow problems and show how they can be used to strengthen existing relaxations. First computational results indicate that the strengthend model is much tighter than the original relaxation, thus promising a computational advantage.

Volltext Dateien herunterladen

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Benjamin HillerORCiD, Kai-Helge Becker
Dokumentart:ZIB-Report
Freies Schlagwort / Tag:MINLPs; acyclic orientations; flow orientations; potential-driven network flows
MSC-Klassifikation:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
CCS-Klassifikation:G. Mathematics of Computing
Datum der Erstveröffentlichung:25.07.2018
Schriftenreihe (Bandnummer):ZIB-Report (18-30)
ISSN:1438-0064
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.