OPAC

検索結果一覧に戻る

Combinatorial Optimization : 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers / edited by Ivana Ljubić, Francisco Barahona, Santanu S. Dey, A. Ridha Mahjoub
(Lecture Notes in Computer Science. ISSN:16113349 ; 13526)

データ種別	電子ブック
版	1st ed. 2022.
出版者	(Cham : Springer International Publishing : Imprint: Springer)
出版年	2022
大きさ	XVII, 337 p. 43 illus., 30 illus. in color : online resource
著者標目	Ljubić, Ivana editor Barahona, Francisco editor Dey, Santanu S editor Mahjoub, A. Ridha editor SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0002089	Computer Scinece R0 2005-6,2022-3				9783031185304

書誌詳細を非表示

一般注記	Polyhedra and Algorithms -- New classes of facets for complementarity knapsack problems -- Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints -- The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm -- Polyhedra and Combinatorics -- Top-$k$ List Aggregation: Mathematical Formulations and Polyhedral Comparisons -- Bounded variation in binary sequences -- On Minimally Non-Firm Binary Matrices -- Few Induced Disjoint Paths for H-Free Graphs -- On Permuting some Coordinates of Polytopes -- Non-linear Optimization -- Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error -- An outer-approximation algorithm for maximum-entropy sampling -- Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization -- Game Theory -- Exact Price of Anarchy for Weighted Congestion Games with Two Players -- Nash balanced assignment problem -- Graphs and Trees -- On the thinness of trees -- Generating Spanning Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms -- Cutting and Packing -- High Multiplicity Strip Packing with Three Rectangle Types -- Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions -- Applications -- One transfer per patient suffices: Structural insights about patient-to-room assignment -- Tool switching problems in the context of overlay printing with multiple colours -- Optimal Vaccination Strategies for Multiple Dose Vaccinations -- Approximation Algorithms -- Pervasive Domination -- Unified Greedy Approximability Beyond Submodular Maximization -- Neighborhood persistency of the linear optimization relaxation of integer linear optimization -- Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022. The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms HTTP:URL=https://doi.org/10.1007/978-3-031-18530-4
件　名	LCSH:Computer science—Mathematics LCSH:Discrete mathematics LCSH:Computer networks LCSH:Algorithms LCSH:Data structures (Computer science) LCSH:Information theory LCSH:Numerical analysis LCSH:Artificial intelligence FREE:Discrete Mathematics in Computer Science FREE:Computer Communication Networks FREE:Design and Analysis of Algorithms FREE:Data Structures and Information Theory FREE:Numerical Analysis FREE:Artificial Intelligence
分　類	LCC:QA76.9.M35 LCC:QA297.4 DC23:004.0151
書誌ID	EB00001477
ISBN	9783031185304