國立虎尾科技大學 |

Generalized Network Improvement and Packing Problems

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Generalized Network Improvement and Packing Problems/ by Michael Holzhauser.
Author:	Holzhauser, Michael.
Description:	XVI, 213 p. 26 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical optimization. -
Online resource:	https://doi.org/10.1007/978-3-658-16812-4
ISBN:	9783658168124

Generalized Network Improvement and Packing Problems
Holzhauser, Michael.

Generalized Network Improvement and Packing Problems[electronic resource] /by Michael Holzhauser. - 1st ed. 2016. - XVI, 213 p. 26 illus.online resource.

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.

ISBN: 9783658168124

Standard No.: 10.1007/978-3-658-16812-4doiSubjects--Topical Terms:

527675
Mathematical optimization.

LC Class. No.: QA402.5-402.6

Dewey Class. No.: 519.6

Generalized Network Improvement and Packing Problems
LDR:02544nam a22003855i 4500 001 980874
003 DE-He213
005 20200629133441.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783658168124 $9 978-3-658-16812-4
024 7 $a 10.1007/978-3-658-16812-4 $2 doi
035 $a 978-3-658-16812-4
050 4 $a QA402.5-402.6
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
100 1 $a Holzhauser, Michael. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1117524
245 1 0 $a Generalized Network Improvement and Packing Problems $h [electronic resource] / $c by Michael Holzhauser.
250 $a 1st ed. 2016.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2016.
300 $a XVI, 213 p. 26 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 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.
520 $a 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.
650 0 $a Mathematical optimization. $3 527675
650 0 $a Algorithms. $3 527865
650 1 4 $a Discrete Optimization. $3 1019327
650 2 4 $a Mathematics of Algorithmic Complexity. $3 1020203
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658168117
776 0 8 $i Printed edition: $z 9783658168131
856 4 0 $u https://doi.org/10.1007/978-3-658-16812-4
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)