大葉大學圖書館 |

Gems of combinatorial optimization and graph algorithms[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	519.64
書名/作者:	Gems of combinatorial optimization and graph algorithms/ edited by Andreas S. Schulz ... [et al.].
其他作者:	Schulz, Andreas S.
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	x, 150 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Calculus of Variations and Optimal Control; Optimization.
標題:	Game Theory, Economics, Social and Behav. Sciences.
標題:	Convex and Discrete Geometry.
標題:	Combinatorics.
標題:	Combinatorial optimization.
標題:	Graph algorithms.
標題:	Mathematics.
標題:	Operations Research, Management Science.
標題:	Algorithms.
ISBN:	9783319249711
ISBN:	9783319249704
內容註:	Shifting Segments to Optimality: Stefan Felsner -- Linear structure of graphs and the knotting graph: Ekkehard Kohler -- Finding Longest Geometric Tours: Sandor P. Fekete -- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Muller-Hannemann -- Budgeted Matching via the Gasoline Puzzle: Guido Schafer -- Motifs in Networks: Karsten Weihe -- Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies: Ben Strasser and Dorothea Wagner -- Shortest Path To Mechanism Design: Rudolf Muller and Marc Uetz -- Selfish Routing and Proportional: Resource Allocation: Andreas S. Schulz -- Resource Buying Games: Tobias Harks and Britta Peis -- Linear, exponential, but nothing else - On pure Nash equilibria in congestion games and priority rules for single-machine scheduling: Max Klimm -- Convex quadratic programming in scheduling: Martin Skutella -- Robustness and approximation for universal sequencing: Nicole Megow -- A Short Note on Long Waiting Lists: Sebastian Stiller.
電子資源:	http://dx.doi.org/10.1007/978-3-319-24971-1

Gems of combinatorial optimization and graph algorithms[electronic resource] /
Gems of combinatorial optimization and graph algorithms[electronic resource] /edited by Andreas S. Schulz ... [et al.]. - Cham :Springer International Publishing :2015. - x, 150 p. :ill., digital ;24 cm.

Shifting Segments to Optimality: Stefan Felsner -- Linear structure of graphs and the knotting graph: Ekkehard Kohler -- Finding Longest Geometric Tours: Sandor P. Fekete -- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Muller-Hannemann -- Budgeted Matching via the Gasoline Puzzle: Guido Schafer -- Motifs in Networks: Karsten Weihe -- Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies: Ben Strasser and Dorothea Wagner -- Shortest Path To Mechanism Design: Rudolf Muller and Marc Uetz -- Selfish Routing and Proportional: Resource Allocation: Andreas S. Schulz -- Resource Buying Games: Tobias Harks and Britta Peis -- Linear, exponential, but nothing else - On pure Nash equilibria in congestion games and priority rules for single-machine scheduling: Max Klimm -- Convex quadratic programming in scheduling: Martin Skutella -- Robustness and approximation for universal sequencing: Nicole Megow -- A Short Note on Long Waiting Lists: Sebastian Stiller.

ISBN: 9783319249711

Standard No.: 10.1007/978-3-319-24971-1doiSubjects--Topical Terms:

464715
Calculus of Variations and Optimal Control; Optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.64

Gems of combinatorial optimization and graph algorithms[electronic resource] /
LDR:02039nam a2200325 a 4500 001 444794
003 DE-He213
005 20160526112959.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783319249711 $q (electronic bk.)
020 $a 9783319249704 $q (paper)
024 7 $a 10.1007/978-3-319-24971-1 $2 doi
035 $a 978-3-319-24971-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a KJT $2 bicssc
072 7 $a KJM $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a BUS042000 $2 bisacsh
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .G323 2015
245 0 0 $a Gems of combinatorial optimization and graph algorithms $h [electronic resource] / $c edited by Andreas S. Schulz ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a x, 150 p. : $b ill., digital ; $c 24 cm.
505 0 $a Shifting Segments to Optimality: Stefan Felsner -- Linear structure of graphs and the knotting graph: Ekkehard Kohler -- Finding Longest Geometric Tours: Sandor P. Fekete -- Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics: Matthias Muller-Hannemann -- Budgeted Matching via the Gasoline Puzzle: Guido Schafer -- Motifs in Networks: Karsten Weihe -- Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies: Ben Strasser and Dorothea Wagner -- Shortest Path To Mechanism Design: Rudolf Muller and Marc Uetz -- Selfish Routing and Proportional: Resource Allocation: Andreas S. Schulz -- Resource Buying Games: Tobias Harks and Britta Peis -- Linear, exponential, but nothing else - On pure Nash equilibria in congestion games and priority rules for single-machine scheduling: Max Klimm -- Convex quadratic programming in scheduling: Martin Skutella -- Robustness and approximation for universal sequencing: Nicole Megow -- A Short Note on Long Waiting Lists: Sebastian Stiller.
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 464715
650 2 4 $a Game Theory, Economics, Social and Behav. Sciences. $3 464103
650 2 4 $a Convex and Discrete Geometry. $3 470189
650 2 4 $a Combinatorics. $3 464913
650 0 $a Combinatorial optimization. $3 467595
650 0 $a Graph algorithms. $3 488190
650 1 4 $a Mathematics. $3 172349
650 2 4 $a Operations Research, Management Science. $3 463666
650 2 4 $a Algorithms. $3 182797
700 1 $a Schulz, Andreas S. $3 589896
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-319-24971-1
950 $a Mathematics and Statistics (Springer-11649)