Flows in networks
Type doc. :
Langue :
Auteur(s) :
Editeur(s) :
Année d'édition :
Thème :
Afficher le Résumé
Flows in Networks, is a foundational work in network flow theory, combinatorial mathematics, and operations research. The book examines how quantities such as goods, traffic, information, or resources can be transferred through a network consisting of nodes and connecting arcs, subject to capacity constraints and other mathematical conditions. Its first chapter introduces the maximum-flow problem and develops methods for determining the greatest possible flow between a source and a destination, including the relationship between flows and cuts and the labeling algorithm for finding optimal solutions. The second chapter establishes feasibility theorems and explores their applications to combinatorial problems, including supply-demand systems, circulation, graph theory, assignment problems, and partially ordered sets. The third chapter focuses on minimum-cost flow problems, showing how network models can be used to optimize transportation, allocation, scheduling, and distribution decisions. Finally, the fourth chapter extends the analysis to networks with multiple terminals, addressing flow optimization between different pairs of nodes and broader questions of network design. Throughout the book, the authors emphasize rigorous mathematical proofs, constructive solution methods, and computational efficiency. The work provides a theoretical foundation for modern optimization algorithms and remains relevant to transportation engineering, telecommunications, logistics, production planning, and computer networking.
| N° Bulletin | Date / Année de parution | Titre N° Spécial | Sommaire |
|---|
| N° d'Exemplaire / inventaire | Cote | Localisation | Type de Support | Type de Prêt | Statut | Date de Restitution Prévue | Réservation |
|---|---|---|---|---|---|---|---|
| 65629A83 | 004 FOR 7 C1 | BIB-Centrale / Ouvrages | Papier | interne | disponible |