大葉大學圖書館 |

Generalized network improvement and packing problems[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	519.6
書名/作者:	Generalized network improvement and packing problems/ by Michael Holzhauser.
作者:	Holzhauser, Michael.
出版者:	Wiesbaden : : Springer Fachmedien Wiesbaden :, 2016.
面頁冊數:	xvi, 213 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Mathematical optimization.
標題:	Mathematics.
標題:	Discrete Optimization.
標題:	Algorithms.
標題:	Mathematics of Algorithmic Complexity.
ISBN:	9783658168124
ISBN:	9783658168117
內容註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-658-16812-4

Generalized network improvement and packing problems[electronic resource] /
Holzhauser, Michael.

Generalized network improvement and packing problems[electronic resource] /by Michael Holzhauser. - Wiesbaden :Springer Fachmedien Wiesbaden :2016. - xvi, 213 p. :ill., digital ;24 cm.

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:

176332
Mathematical optimization.

LC Class. No.: QA402.5 / .H65 2016

Dewey Class. No.: 519.6

Generalized network improvement and packing problems[electronic resource] /
LDR:02187nam a2200313 a 4500 001 477354
003 DE-He213
005 20170104123926.0
006 m d
007 cr nn 008maaau
008 181208s2016 gw s 0 eng d
020 $a 9783658168124 $q (electronic bk.)
020 $a 9783658168117 $q (paper)
024 7 $a 10.1007/978-3-658-16812-4 $2 doi
035 $a 978-3-658-16812-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5 $b .H65 2016
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
082 0 4 $a 519.6 $2 23
090 $a QA402.5 $b .H762 2016
100 1 $a Holzhauser, Michael. $3 688861
245 1 0 $a Generalized network improvement and packing problems $h [electronic resource] / $c by Michael Holzhauser.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Spektrum, $c 2016.
300 $a xvi, 213 p. : $b ill., digital ; $c 24 cm.
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 176332
650 1 4 $a Mathematics. $3 172349
650 2 4 $a Discrete Optimization. $3 603969
650 2 4 $a Algorithms. $3 182797
650 2 4 $a Mathematics of Algorithmic Complexity. $3 611242
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-658-16812-4
950 $a Mathematics and Statistics (Springer-11649)