東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Graphs and combinatorial optimization = from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graphs and combinatorial optimization/ edited by Andreas Brieden, Stefan Pickl, Markus Siegle.
其他題名:	from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 /
其他題名:	CTW 2023
其他作者:	Brieden, Andreas.
團體作者:	Cologne-Twente Workshop on Graphs and Combinatorial Optimization
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	x, 202 p. :ill. (some col.), digital ;24 cm.
內容註:	On syntactical graphs-of-words -- k-slow Burning: Complexity and Upper Bounds -- Exact approaches for the Connected Vertex Cover problem -- Handling Sub-symmetry in Integer Programming using Activation Handlers -- Online Facility Location: comparing ad-hoc and MIP-based algorithms -- A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem -- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints -- The algorithmic complexity of the Paired Matching problem -- Edge Contraction and Forbidden Induced Subgraphs -- Rigidity of frameworks on spheres -- Discrepancies of subtrees -- Data-driven feasibility for the Resource Constraint Shortest Path Problem -- Monte-Carlo Integration on a Union of Polytopes -- Managing Time Expanded Networks: The Strong Lift Problem.
Contained By:	Springer Nature eBook
標題:	Graph theory - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-46826-1
ISBN:	9783031468261

Graphs and combinatorial optimization = from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 /
Graphs and combinatorial optimizationfrom Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 /[electronic resource] :CTW 2023edited by Andreas Brieden, Stefan Pickl, Markus Siegle. - Cham :Springer Nature Switzerland :2024. - x, 202 p. :ill. (some col.), digital ;24 cm. - AIRO springer series,v. 132523-7055 ;. - AIRO springer series ;v. 13..

On syntactical graphs-of-words -- k-slow Burning: Complexity and Upper Bounds -- Exact approaches for the Connected Vertex Cover problem -- Handling Sub-symmetry in Integer Programming using Activation Handlers -- Online Facility Location: comparing ad-hoc and MIP-based algorithms -- A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem -- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints -- The algorithmic complexity of the Paired Matching problem -- Edge Contraction and Forbidden Induced Subgraphs -- Rigidity of frameworks on spheres -- Discrepancies of subtrees -- Data-driven feasibility for the Resource Constraint Shortest Path Problem -- Monte-Carlo Integration on a Union of Polytopes -- Managing Time Expanded Networks: The Strong Lift Problem.

This book contains the proceedings of the 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, held during June 20-22, 2023, in Garmisch-Partenkirchen, Germany. This successful series of international workshops is known to attract high-quality research on the theory and application of discrete algorithms, graphs, and combinatorial optimization in a wide sense. The papers collected in this book represent cutting-edge research by leading researchers and attract a broad readership in academia worldwide. The book is addressed to researchers and advanced students, but also to professionals in industry concerned with algorithm design and optimization problems in different areas of application.

ISBN: 9783031468261

Standard No.: 10.1007/978-3-031-46826-1doiSubjects--Topical Terms:

624690
Graph theory
--Congresses.

LC Class. No.: QA166 / .C55 2023

Dewey Class. No.: 511.5

Graphs and combinatorial optimization = from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 /
LDR:02736nmm a2200349 a 4500 001 2369229
003 DE-He213
005 20240222125238.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031468261 $q (electronic bk.)
020 $a 9783031468254 $q (paper)
024 7 $a 10.1007/978-3-031-46826-1 $2 doi
035 $a 978-3-031-46826-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166 $b .C55 2023
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .C718 2023
111 2 $a Cologne-Twente Workshop on Graphs and Combinatorial Optimization $n (19th : $d 2023 : $c Garmisch-Partenkirchen, Germany) $3 3713746
245 1 0 $a Graphs and combinatorial optimization $h [electronic resource] : $b from Theory to Applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20-22 / $c edited by Andreas Brieden, Stefan Pickl, Markus Siegle.
246 3 $a CTW 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a x, 202 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a AIRO springer series, $x 2523-7055 ; $v v. 13
505 0 $a On syntactical graphs-of-words -- k-slow Burning: Complexity and Upper Bounds -- Exact approaches for the Connected Vertex Cover problem -- Handling Sub-symmetry in Integer Programming using Activation Handlers -- Online Facility Location: comparing ad-hoc and MIP-based algorithms -- A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem -- On the Optimality Gap of Full Airport Slot Assignments: Capacity-limited Packing with Pareto Optimality Constraints -- The algorithmic complexity of the Paired Matching problem -- Edge Contraction and Forbidden Induced Subgraphs -- Rigidity of frameworks on spheres -- Discrepancies of subtrees -- Data-driven feasibility for the Resource Constraint Shortest Path Problem -- Monte-Carlo Integration on a Union of Polytopes -- Managing Time Expanded Networks: The Strong Lift Problem.
520 $a This book contains the proceedings of the 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, held during June 20-22, 2023, in Garmisch-Partenkirchen, Germany. This successful series of international workshops is known to attract high-quality research on the theory and application of discrete algorithms, graphs, and combinatorial optimization in a wide sense. The papers collected in this book represent cutting-edge research by leading researchers and attract a broad readership in academia worldwide. The book is addressed to researchers and advanced students, but also to professionals in industry concerned with algorithm design and optimization problems in different areas of application.
650 0 $a Graph theory $v Congresses. $3 624690
650 0 $a Combinatorial optimization $x Congresses. $3 705091
650 1 4 $a Optimization. $3 891104
650 2 4 $a Graph Theory. $3 1567033
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Applications of Discrete Mathematics. $3 3599507
700 1 $a Brieden, Andreas. $3 3713747
700 1 $a Pickl, Stefan. $3 1005931
700 1 $a Siegle, Markus. $3 3713748
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a AIRO springer series ; $v v. 13. $3 3713749
856 4 0 $u https://doi.org/10.1007/978-3-031-46826-1
950 $a Mathematics and Statistics (SpringerNature-11649)