Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Januar 2017
Genre:	Schulbücher
	Algorithmen und Datenstrukturen / algorithmiccomplexity / Algorithmus / Angewandte Mathematik / Approximability / ComputationalComplexity / FractionalPacking / Mathematik / Mathematik / Logik / MaximumFlowProblems / MinimumCostFlowProblems / Modell / Optimierung mehr...
ISBN:	9783658168117
EAN-Code:	9783658168117
Verlag:	Springer Gabler
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 210 mm / B 148 mm / D 13 mm
Gewicht:	306 gr
Seiten:	232
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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. Contents 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 Target Groups Researchers and students in the fields of mathematics, computer science, and economics Practitioners in operations research and logistics The AuthorDr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.