03023nam 22004935 450 991015867050332120251116170917.0978365816812410.1007/978-3-658-16812-4(CKB)3710000001009154(DE-He213)978-3-658-16812-4(MiAaPQ)EBC4776566(PPN)19834001X(EXLCZ)99371000000100915420170104d2016 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierGeneralized network improvement and packing problems /by Michael Holzhauser1st ed. 2016.Wiesbaden :Springer Fachmedien Wiesbaden :Imprint: Springer Spektrum,2016.1 online resource (XVI, 213 p. 26 illus.)3-658-16812-9 3-658-16811-0 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.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 Author Dr. 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.Mathematical optimizationAlgorithmsDiscrete Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26040Algorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Mathematics of Algorithmic Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/M13130Mathematical optimization.Algorithms.Discrete Optimization.Algorithms.Mathematics of Algorithmic Complexity.519.6Holzhauser Michaelauthttp://id.loc.gov/vocabulary/relators/aut755926BOOK9910158670503321Generalized network improvement and packing problems1523362UNINA