Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Introduction
verfasst von : Andreas Bärmann
Erschienen in: Solving Network Design Problems via Decomposition, Aggregation and Approximation
Verlag: Springer Fachmedien Wiesbaden
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The optimal design of networks is an interesting combinatorial optimization problem which has received a lot of attention in recent decades. In its simplest form, it may be stated as follows. We are given a directed graph $$ G = \left( {V,A} \right) $$ with node set V and arc set A together with a set $$ {\mathcal{R}} \subseteq \left\{ {\left( {u,w} \right) \in V \times V\left| {u \ne w} \right.} \right\} $$ of origin-destination pairs.