Generalized Network Improvement and Packing Problems

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.

Sommario

Fractional Packing and Parametric Search Frameworks.- Budget-Constrained Minimum Cost Flows: The Continuous Case.- Budget-Constrained Minimum Cost Flows: The Discrete Case.- Generalized Processing Networks.- Convex Generalized Flows.

Dettagli sul prodotto

• Autori: Michael Holzhauser
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 12.01.2017
• EAN: 9783658168117
• ISBN: 978-3-658-16811-7
• Pagine: 213
• Dimensioni: 202 mm x 15 mm x 212 mm
• Peso: 324 g
• Illustrazioni: XVI, 213 p. 26 illus.
• Categorie: Scienze naturali, medicina, informatica, tecnica > Matematica > Altro; C, Algorithmen und Datenstrukturen, Algorithms, Angewandte Mathematik, Mathematics and Statistics, Applications of Mathematics, Numerical analysis, Mathematical optimization, Mathematical modelling, Mathematics of Algorithmic Complexity, Discrete Optimization