楽天市場検索
レディースファッション
(0)
メンズファッション
(0)
インナー・下着・ナイトウェア
(0)
バッグ・小物・ブランド雑貨
(0)
靴
(0)
腕時計
(0)
ジュエリー・アクセサリー
(0)
キッズ・ベビー・マタニティ
(0)
おもちゃ
(0)
スポーツ・アウトドア
(0)
家電
(0)
TV・オーディオ・カメラ
(0)
パソコン・周辺機器
(0)
スマートフォン・タブレット
(0)
光回線・モバイル通信
(0)
食品
(0)
スイーツ・お菓子
(0)
水・ソフトドリンク
(0)
ビール・洋酒
(0)
日本酒・焼酎
(0)
インテリア・寝具・収納
(0)
日用品雑貨・文房具・手芸
(0)
キッチン用品・食器・調理器具
(0)
本・雑誌・コミック
(202)
(Combinatoria 電子書籍)
CD・DVD
(0)
テレビゲーム
(0)
ホビー
(0)
楽器・音響機器
(0)
車・バイク
(0)
車用品・バイク用品
(0)
美容・コスメ・香水
(0)
ダイエット・健康
(0)
医薬品・コンタクト・介護
(0)
ペット・ペットグッズ
(0)
花・ガーデン・DIY
(0)
サービス・リフォーム
(0)
住宅・不動産
(0)
カタログギフト・チケット
(0)
百貨店・総合通販・ギフト
(0)
|
202件中 1件 - 30件
1 2 3 4 5 6
商品 | 説明 | 価格 |

The Art of Computer Programming Volume 4A Combinatorial Algorithms Part1 日本語版【電子書籍】[ Donald E.Knuth ]
楽天Kobo電子書籍ストア
|
<p>「組合せアルゴリズムは,早い話で順列やグラフなど,組合せ対象の高速処理の技術であると定義できる.われわれはある制約を満たす最良のパターンや配置を探そうとする.そういう問題は極めて多く,わずかな優れた工夫でも数年分,数世紀分の計算時間を節約し得るので,そういうプログラムを書く技法は特に重要であり,感動である.」(本書「序」より)。この巻では、広大な組合せアルゴリズムの分野における基本的な考え方を理解していきます。論理代数の使い方、グラフ理論、バックトラッキングなど、中核をなすアルゴリズムを取り上げます。</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
5,280円
|

The Art of Computer Programming Volume 4B Combinatorial Algorithms Part2 日本語版【電子書籍】[ Donald E. Knuth ]
楽天Kobo電子書籍ストア
|
<p>「組合せアルゴリズムは,私たちを多数の場合を含む問題に対処させる方法である.そういう技術の知識の爆発的な増加は,その記述に数巻の書を必要とする.... 本書はそのシリーズの2番手であり,第4A巻の後継である.」(本書「序」より)。この巻では,組合せアルゴリズムの重要な部分となる「バックトラック」を解説します。</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
6,380円
|

Automatic Generation of Combinatorial Test Data【電子書籍】[ Jian Zhang ]
楽天Kobo電子書籍ストア
|
<p>This book reviews the state-of-the-art in combinatorial testing, with particular emphasis on the automatic generation of test data. It describes the most commonly used approaches in this area - including algebraic construction, greedy methods, evolutionary computation, constraint solving and optimization - and explains major algorithms with examples. In addition, the book lists a number of test generation tools, as well as benchmarks and applications. Addressing a multidisciplinary topic, it will be of particular interest to researchers and professionals in the areas of software testing, combinatorics, constraint solving and evolutionary computation.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
6,076円
|

Nonlinear Combinatorial Optimization【電子書籍】
楽天Kobo電子書籍ストア
|
<p>Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
10,331円
|

Slicing The Truth: On The Computable And Reverse Mathematics Of Combinatorial Principles【電子書籍】[ Denis R Hirschfeldt ]
楽天Kobo電子書籍ストア
|
<p>This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
2,466円
|

Combinatorial Set Theory of C*-algebras【電子書籍】[ Ilijas Farah ]
楽天Kobo電子書籍ストア
|
<p>This book explores and highlights the fertile interaction between logic and operator algebras, which in recent years has led to the resolution of several long-standing open problems on C*-algebras. The interplay between logic and operator algebras (C*-algebras, in particular) is relatively young and the author is at the forefront of this interaction. The deep level of scholarship contained in these pages is evident and opens doors to operator algebraists interested in learning about the set-theoretic methods relevant to their field, as well as to set-theorists interested in expanding their view to the non-commutative realm of operator algebras. Enough background is included from both subjects to make the book a convenient, self-contained source for students. A fair number of the exercises form an integral part of the text. They are chosen to widen and deepen the material from the corresponding chapters. Some other exercises serve as a warmup for the latter chapters.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
14,585円
|

Commutative Algebra Geometric, Homological, Combinatorial and Computational Aspects【電子書籍】
楽天Kobo電子書籍ストア
|
<p>Packed with contributions from international experts, Commutative Algebra: Geometric, Homological, Combinatorial, and Computational Aspects features new research results that borrow methods from neighboring fields such as combinatorics, homological algebra, polyhedral geometry, symbolic computation, and topology. This book consists of articles pres</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
45,144円
|

Handbook of Discrete and Combinatorial Mathematics【電子書籍】
楽天Kobo電子書籍ストア
|
<p><em><strong>Handbook of Discrete and Combinatorial Mathematics</strong></em> provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.</p> <p>The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of which is organized into clearly identifiable parts: definitions, facts, and examples.</p> <p>Examples are provided to illustrate some of the key definitions, facts, and algorithms. Some curious and entertaining facts and puzzles are also included. Readers will also find an extensive collection of biographies.</p> <p>This second edition is a major revision. It includes extensive additions and updates. Since the first edition appeared in 1999, many new discoveries have been made and new areas have grown in importance, which are covered in this edition.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
52,400円
|

Introduction to Combinatorial Optimization【電子書籍】[ Ding-Zhu Du ]
楽天Kobo電子書籍ストア
|
<p>Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, suchas greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
6,076円
|

Quantum Fields and Processes A Combinatorial Approach【電子書籍】[ John Gough ]
楽天Kobo電子書籍ストア
|
<p>Wick ordering of creation and annihilation operators is of fundamental importance for computing averages and correlations in quantum field theory and, by extension, in the Hudson?Parthasarathy theory of quantum stochastic processes, quantum mechanics, stochastic processes, and probability. This book develops the unified combinatorial framework behind these examples, starting with the simplest mathematically, and working up to the Fock space setting for quantum fields. Emphasizing ideas from combinatorics such as the role of lattice of partitions for multiple stochastic integrals by Wallstrom?Rota and combinatorial species by Joyal, it presents insights coming from quantum probability. It also introduces a 'field calculus' which acts as a succinct alternative to standard Feynman diagrams and formulates quantum field theory (cumulant moments, Dyson?Schwinger equation, tree expansions, 1-particle irreducibility) in this language. Featuring many worked examples, the book is aimed at mathematical physicists, quantum field theorists, and probabilists, including graduate and advanced undergraduate students.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
12,770円
|

A Combinatorial Perspective on Quantum Field Theory【電子書籍】[ Karen Yeats ]
楽天Kobo電子書籍ストア
|
<p>This book explores combinatorial problems and insights in quantum field theory. It is not comprehensive, but rather takes a tour, shaped by the author’s biases, through some of the important ways that a combinatorial perspective can be brought to bear on quantum field theory. Among the outcomes are both physical insights and interesting mathematics.</p> <p>The book begins by thinking of perturbative expansions as kinds of generating functions and then introduces renormalization Hopf algebras. The remainder is broken into two parts. The first part looks at Dyson-Schwinger equations, stepping gradually from the purely combinatorial to the more physical. The second part looks at Feynman graphs and their periods.</p> <p>The flavour of the book will appeal to mathematicians with a combinatorics background as well as mathematical physicists and other mathematicians.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
7,292円
|

Combinatorial Identities For Stirling Numbers: The Unpublished Notes Of H W Gould【電子書籍】[ Jocelyn Quaintance ]
楽天Kobo電子書籍ストア
|
<p>This book is a unique work which provides an in-depth exploration into the mathematical expertise, philosophy, and knowledge of H W Gould. It is written in a style that is accessible to the reader with basic mathematical knowledge, and yet contains material that will be of interest to the specialist in enumerative combinatorics. This book begins with exposition on the combinatorial and algebraic techniques that Professor Gould uses for proving binomial identities. These techniques are then applied to develop formulas which relate Stirling numbers of the second kind to Stirling numbers of the first kind. Professor Gould's techniques also provide connections between both types of Stirling numbers and Bernoulli numbers. Professor Gould believes his research success comes from his intuition on how to discover combinatorial identities.This book will appeal to a wide audience and may be used either as lecture notes for a beginning graduate level combinatorics class, or as a research supplement for the specialist in enumerative combinatorics.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
4,934円
|

Lo esencial en combinatoria【電子書籍】[ Rolando E. Reytor Rodr?guez ]
楽天Kobo電子書籍ストア
|
<p>Aqu? se exponen las Reglas Generales de la combinatoria, los Principios Aditivo y Multiplicativo, las variaciones, permutaciones y combinaciones con y sin repetici?n. se definen estos conceptos y se describen, enfatizando en las caracter?sticas que permiten identificarlos en el trabajo pr?ctico, se deducen las f?rmulas para el c?lculo combinatorio y se enuncian en forma de teoremas con sus respectivas demostraciones.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
806円
|

Caballeros, bribones y p?jaros egoc?ntricos Ejercicios de l?gica combinatoria【電子書籍】[ Raymond Smullyan ]
楽天Kobo電子書籍ストア
|
<p>El matem?tico y l?gico combinatorio Haskell Curry, adem?s de ser un especialista en la teor?a de sistemas y procesos formales, fue un ?vido observador de p?jaros. Motivado por la memoria del difunto profesor Curry, Raymond Smullyan eligi? p?jaros como objetos combinadores de algunas adivinanzas que aparecen en esta obra singular. La raz?n por la que el autor escogi? la l?gica combinatoria como tema central de su libro no fue la existencia de m?ltiples aplicaciones pr?cticas, sino su gran potencial de entretenimiento. Si bien es una ciencia abstracta considerada altamente t?cnica, los objetos llamados combinadores presentados por Smullyan bajo la apariencia de caballeros veraces, bribones mentirosos o p?jaros parlantes permiten introducir teor?as fundamentales de la l?gica moderna de forma muy accesible para el p?blico en general. ?Qu? mejor para un libro de misterios y acertijos?</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
1,100円
|

Multi-Objective Combinatorial Optimization Problems and Solution Methods【電子書籍】
楽天Kobo電子書籍ストア
|
<p>Multi-Objective Combinatorial Optimization Problems and Solution Methods discusses the results of a recent multi-objective combinatorial optimization achievement that considered metaheuristic, mathematical programming, heuristic, hyper heuristic and hybrid approaches. In other words, the book presents various multi-objective combinatorial optimization issues that may benefit from different methods in theory and practice. Combinatorial optimization problems appear in a wide range of applications in operations research, engineering, biological sciences and computer science, hence many optimization approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic and algebraic techniques. This book covers this important topic as computational optimization has become increasingly popular as design optimization and its applications in engineering and industry have become ever more important due to more stringent design requirements in modern engineering practice. - Presents a collection of the most up-to-date research, providing a complete overview of multi-objective combinatorial optimization problems and applications - Introduces new approaches to handle different engineering and science problems, providing the field with a collection of related research not already covered in the primary literature - Demonstrates the efficiency and power of the various algorithms, problems and solutions, including numerous examples that illustrate concepts and algorithms</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
17,975円
|

Finite Geometry and Combinatorial Applications【電子書籍】[ Simeon Ball ]
楽天Kobo電子書籍ストア
|
<p>The projective and polar geometries that arise from a vector space over a finite field are particularly useful in the construction of combinatorial objects, such as latin squares, designs, codes and graphs. This book provides an introduction to these geometries and their many applications to other areas of combinatorics. Coverage includes a detailed treatment of the forbidden subgraph problem from a geometrical point of view, and a chapter on maximum distance separable codes, which includes a proof that such codes over prime fields are short. The author also provides more than 100 exercises (complete with detailed solutions), which show the diversity of applications of finite fields and their geometries. Finite Geometry and Combinatorial Applications is ideal for anyone, from a third-year undergraduate to a researcher, who wishes to familiarise themselves with and gain an appreciation of finite geometry.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
7,868円
|

Combinatorial Auctions in Truckload Transportation【電子書籍】[ Ronny Thyssen ]
楽天Kobo電子書籍ストア
|
<p>Studienarbeit aus dem Jahr 2006 im Fachbereich BWL - Unternehmensforschung, Operations Research, Note: 2,0, Rheinisch-Westf?lische Technische Hochschule Aachen, 12 Quellen im Literaturverzeichnis, Sprache: Deutsch, Abstract: 'Als kombinatorische Auktion bezeichnet man eine Auktion, bei der eine Menge verschiedener, unteilbarer G?ter gleichzeitig angeboten wird und die Bieter f?r jede beliebige G?terkombination Gebote abgeben k?nnen. Die Verwendung kombinatorischer Auktionen besitzt immer dann Effizienzvorteile gegen?ber einer Einzelversteigerung der G?ter, wenn der Wert eines Gutes f?r einen Bieter davon abh?ngt, welche anderen G?ter er au?erdem erh?lt.' Ausgangsartikel zu dieser Seminararbeit ist die Publikation 'Combinatorial Auctions for Truckload Transportation' von Chris Caplice und Yossi Sheffi. Dieser Aufsatz konzentriert sich auf den US-amerikanischen Markt, da hier die meisten kombinatorischen Auktionen im Transportwesen stattfinden. Eine kombinatorische Auktion im Transportgewerbe besteht haupts?chlich aus zwei Parteien: dem 'shipper', also die Versender wie z.B. Hersteller oder H?ndler und dem beauftragten 'carrier'; also den Spediteuren. Die 'shipper' sind die Auktionatoren und die 'carrier' die Bieter. In vielen F?llen kommt noch eine dritte Partei hinzu: Ein Software-Anbieter, eine Beraterfirma oder ein unabh?ngiger Logistikanbieter, die die Auktion f?r den 'shipper' abwickeln und somit als Auktionator agieren. Der gewerbliche G?terverkehr in den Vereinigten Staaten von Amerika setzte im Jahre 2003 mehr als 701 Milliarden $ um, und hat mit 6,3 % einen nicht unerheblichen Anteil am Bruttoinlandsprodukt des Landes. Obwohl es unz?hlige Transportm?glichkeiten wie Schienenverkehr, Luftfracht, Pipelines etc. gibt, ist der LKW-Verkehr seit jeher das vorherrschende Transportmittel. Nach Standard & Poor´s machte er im Jahre 2004 beachtliche 86,9 % des kommerziellen Frachtverkehrs aus. Im LKW-Verkehr ist die Unterscheidung zwischen Sammelgutverkehr (auch Sammelladungsverkehr) und Direktverkehr wichtig. Beim Sammelladungsverkehr stammt die Ware von mehreren verschiedenen Versendern und muss meist an unterschiedliche Empf?nger geliefert werden. Wohingegen beim Direktverkehr die Ware ohne Umwege direkt vom Absender zum Empf?nger transportiert wird.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
836円
|

Combinatorial Optimization and Applications 17th International Conference, COCOA 2024, Beijing, China, December 6?8, 2024, Proceedings, Part I【電子書籍】
楽天Kobo電子書籍ストア
|
<p>The two-volume set, LNCS 15434 and 15435, constitutes the refereed post-conference proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2024, held in Beijing, China, during December 6?8, 2024.</p> <p>The 53 full papers included in the proceedings were carefully reviewed and selected from 124 submissions. They deal with combinatorial optimization and its applications, including algorithm design, theoretical and experimental analysis, and applied research of general algorithmic interest.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
18,231円
|

Integer Programming and Combinatorial Optimization 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27?29, 2022, Proceedings【電子書籍】
楽天Kobo電子書籍ストア
|
<p>This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
10,331円
|

Colored Discrete Spaces Higher Dimensional Combinatorial Maps and Quantum Gravity【電子書籍】[ Luca Lionni ]
楽天Kobo電子書籍ストア
|
<p>This book provides a number of combinatorial tools that allow a systematic study of very general discrete spaces involved in the context of discrete quantum gravity. In any dimension D, we can discretize Euclidean gravity in the absence of matter over random discrete spaces obtained by gluing families of polytopes together in all possible ways. These spaces are then classified according to their curvature. In D=2, it results in a theory of random discrete spheres, which converge in the continuum limit towards the Brownian sphere, a random fractal space interpreted as a quantum random space-time. In this limit, the continuous Liouville theory of D=2 quantum gravity is recovered.</p> <p>Previous results in higher dimension regarded triangulations, converging towards a continuum random tree, or gluings of simple building blocks of small sizes, for which multi-trace matrix model results are recovered in any even dimension. In this book, the author develops a bijection with stacked two-dimensional discrete surfaces for the most general colored building blocks, and details how it can be used to classify colored discrete spaces according to their curvature. The way in which this combinatorial problem arrises in discrete quantum gravity and random tensor models is discussed in detail.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
12,154円
|

Combinatorial Algorithms 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1?3, 2024, Proceedings【電子書籍】
楽天Kobo電子書籍ストア
|
<p>This book constitutes the refereed proceedings of the 35th International Workshop on Combinatorial Algorithms, IWOCA 2024, held in Ischia, Italy, during July 1?3, 2024.</p> <p>The 40 full papers included in this book were carefully reviewed and selected from 110 submissions. The IWOCA conference series has provided an annual forum for researchers who design algorithms to address the myriad combinatorial problems underlying computer applications in science, engineering, and business.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
10,938円
|

Construct, Merge, Solve & Adapt A Hybrid Metaheuristic for Combinatorial Optimization【電子書籍】[ Christian Blum ]
楽天Kobo電子書籍ストア
|
<p>This book describes a general hybrid metaheuristic for combinatorial optimization labeled Construct, Merge, Solve & Adapt (CMSA). The general idea of standard CMSA is the following one. At each iteration, a number of valid solutions to the tackled problem instance are generated in a probabilistic way. Hereby, each of these solutions is composed of a set of solution components. The components found in the generated solutions are then added to an initially empty sub-instance. Next, an exact solver is applied in order to compute the best solution of the sub-instance, which is then used to update the sub-instance provided as input for the next iteration. In this way, the power of exact solvers can be exploited for solving problem instances much too large for a standalone application of the solver.</p> <p>Important research lines on CMSA from recent years are covered in this book. After an introductory chapter about standard CMSA, subsequent chapters cover a self-adaptive CMSA variant as well as a variant equipped with a learning component for improving the quality of the generated solutions over time. Furthermore, on outlining the advantages of using set-covering-based integer linear programming models for sub-instance solving, the author shows how to apply CMSA to problems naturally modelled by non-binary integer linear programming models. The book concludes with a chapter on topics such as the development of a problem-agnostic CMSA and the relation between large neighborhood search and CMSA. Combinatorial optimization problems used in the book as test cases include the minimum dominating set problem, the variable-sized bin packing problem, and an electric vehicle routing problem.</p> <p>The book will be valuable and is intended for researchers, professionals and graduate students working in a wide range of fields, such as combinatorial optimization, algorithmics, metaheuristics, mathematical modeling, evolutionary computing, operations research, artificial intelligence, or statistics.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
18,231円
|

Integer Programming and Combinatorial Optimization 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3?5, 2024, Proceedings【電子書籍】
楽天Kobo電子書籍ストア
|
<p>This book constitutes the refereed proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2024, held in Wroc?aw, Poland, during July 3?5, 2024.</p> <p>The 33 full papers presented were carefully reviewed and selected from 101 submissions.</p> <p>IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
9,966円
|

Seriation in Combinatorial and Statistical Data Analysis【電子書籍】[ Isra?l C?sar Lerman ]
楽天Kobo電子書籍ストア
|
<p>This monograph offers an original broad and very diverse exploration of the seriation domain in data analysis, together with building a specific relation to clustering.</p> <p>Relative to a data table crossing a set of objects and a set of descriptive attributes, the search for orders which correspond respectively to these two sets is formalized mathematically and statistically.</p> <p>State-of-the-art methods are created and compared with classical methods and a thorough understanding of the mutual relationships between these methods is clearly expressed. The authors distinguish two families of methods:</p> <ul> <li>Geometric representation methods</li> <li>Algorithmic and Combinatorial methods</li> </ul> <p>Original and accurate methods are provided in the framework for both families. Their basis and comparison is made on both theoretical and experimental levels. The experimental analysis is very varied and very comprehensive. <em>Seriation in Combinatorial and Statistical Data Analysis</em> has a unique character in the literature falling within the fields of Data Analysis, Data Mining and Knowledge Discovery. It will be a valuable resource for students and researchers in the latter fields.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
19,447円
|

Combinatorial Reasoning An Introduction to the Art of Counting【電子書籍】[ Duane DeTemple ]
楽天Kobo電子書籍ストア
|
<p>Written by two well-known scholars in the field, <em>Combinatorial Reasoning: An Introduction to the Art of Counting</em> presents a clear and comprehensive introduction to the concepts and methodology of beginning combinatorics. Focusing on modern techniques and applications, the book develops a variety of effective approaches to solving counting problems.</p> <p>Balancing abstract ideas with specific topical coverage, the book utilizes real world examples with problems ranging from basic calculations that are designed to develop fundamental concepts to more challenging exercises that allow for a deeper exploration of complex combinatorial situations. Simple cases are treated first before moving on to general and more advanced cases. Additional features of the book include:</p> <p>? Approximately 700 carefully structured problems designed for readers at multiple levels, many with hints and/or short answers<br /> ? Numerous examples that illustrate problem solving using both combinatorial reasoning and sophisticated algorithmic methods<br /> ? A novel approach to the study of recurrence sequences, which simplifies many proofs and calculations<br /> ? Concrete examples and diagrams interspersed throughout to further aid comprehension of abstract concepts<br /> ? A chapter-by-chapter review to clarify the most crucial concepts covered</p> <p><em>Combinatorial Reasoning: An Introduction to the Art of Counting</em> is an excellent textbook for upper-undergraduate and beginning graduate-level courses on introductory combinatorics and discrete mathematics.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
18,226円
|

Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory【電子書籍】[ Mauro Di Nasso ]
楽天Kobo電子書籍ストア
|
<p>The goal of this monograph is to give an accessible introduction to nonstandard methods and their applications, with an emphasis on combinatorics and Ramsey theory. It includes both new nonstandard proofs of classical results and recent developments initially obtained in the nonstandard setting. This makes it the first combinatorics-focused account of nonstandard methods to be aimed at a general (graduate-level) mathematical audience. This book will provide a natural starting point for researchers interested in approaching the rapidly growing literature on combinatorial results obtained via nonstandard methods. The primary audience consists of graduate students and specialists in logic and combinatorics who wish to pursue research at the interface between these areas.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
6,076円
|

Facets of Combinatorial Optimization Festschrift for Martin Gr?tschel【電子書籍】
楽天Kobo電子書籍ストア
|
<p>Martin Gr?tschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday on September 10, 2013. Martin Gr?tschel’s doctoral descendant tree 1983?2012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren and 2 great-great-grandchildren, a total of 139 doctoral descendants.</p> <p>This book starts with a personal tribute to Martin Gr?tschel by the editors (Part I), a contribution by his very special “predecessor” Manfred Padberg on “Facets and Rank of Integer Polyhedra” (Part II), and the doctoral descendant tree 1983?2012 (Part III). The core of this book (Part IV) contains 16 contributions, each of which is coauthored by at least one doctoral descendant.</p> <p>The sequence of the articles starts with contributions to the theory of mathematical optimization, including polyhedral combinatorics, extended formulations, mixed-integer convex optimization, super classes of perfect graphs, efficient algorithms for subtree-telecenters, junctions in acyclic graphs and preemptive restricted strip covering, as well as efficient approximation of non-preemptive restricted strip covering.</p> <p>Combinations of new theoretical insights with algorithms and experiments deal with network design problems, combinatorial optimization problems with submodular objective functions and more general mixed-integer nonlinear optimization problems. Applications include VLSI layout design, systems biology, wireless network design, mean-risk optimization and gas network optimization.</p> <p>Computational studies include a semidefinite branch and cut approach for the max k-cut problem, mixed-integer nonlinear optimal control, and mixed-integer linear optimization for scheduling and routing of fly-in safari planes.</p> <p>The two closing articles are devoted to computational advances in generalmixed integer linear optimization, the first by scientists working in industry, the second by scientists working in academia.</p> <p>These articles reflect the “scientific facets” of Martin Gr?tschel who has set standards in theory, computation and applications.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
12,154円
|

Combinatorial Optimization 7th International Symposium, ISCO 2022, Virtual Event, May 18?20, 2022, Revised Selected Papers【電子書籍】
楽天Kobo電子書籍ストア
|
<p>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.</p> <p>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.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
9,116円
|

Metaheuristics for Combinatorial Optimization【電子書籍】
楽天Kobo電子書籍ストア
|
<p>This book presents novel and original metaheuristics developed to solve the cost-balanced traveling salesman problem. This problem was taken into account for the Metaheuristics Competition proposed in MESS 2018, Metaheuristics Summer School, and the top 4 methodologies ranked are included in the book, together with a brief introduction to the traveling salesman problem and all its variants.</p> <p>The book is aimed particularly at all researchers in metaheuristics and combinatorial optimization areas.</p> <p>Key uses are metaheuristics; complex problem solving; combinatorial optimization; traveling salesman problem.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
21,878円
|

Leibniz: Dissertation on Combinatorial Art【電子書籍】
楽天Kobo電子書籍ストア
|
<p>Leibniz published the Dissertation on Combinatorial Art in 1666. This book contains the seeds of Leibniz's mature thought, as well as many of the mathematical ideas that he would go on to further develop after the invention of the calculus. It is in the Dissertation, for instance, that we find the project for the construction of a logical calculus clearly expressed for the first time. The idea of encoding terms and propositions by means of numbers, later developed by Kurt G?del, also appears in this work. In this text, furthermore, Leibniz conceives the possibility of constituting a universal language or universal characteristic, a project that he would pursue for the rest of his life. Mugnai, van Ruler, and Wilson present the first full English translation of the Dissertation, complete with a critical introduction and a comprehensive commentary.</p>画面が切り替わりますので、しばらくお待ち下さい。 ※ご購入は、楽天kobo商品ページからお願いします。※切り替わらない場合は、こちら をクリックして下さい。 ※このページからは注文できません。
|
7,961円
|
|