You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in Bonn, Germany, in June 2014. The 34 full papers presented were carefully reviewed and selected from 143 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. 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.
In dieser Arbeit entwickeln wir schnellere exakte Algorithmen (schneller bezüglich der Worst-Case-Laufzeit) für Spezialfälle von Graphproblemen. Diese Algorithmen beruhen größtenteils auf dynamischem Programmieren und auf 2-SAT-Programmierung. Dynamisches Programmieren beschreibt den Vorgang, ein Problem rekursiv in Unterprobleme zu zerteilen, sodass diese Unterprobleme gemeinsame Unterunterprobleme haben. Wenn diese Unterprobleme optimal gelöst wurden, dann kombiniert das dynamische Programm diese Lösungen zu einer optimalen Lösung des Ursprungsproblems. 2-SAT-Programmierung bezeichnet den Prozess, ein Problem durch eine Menge von 2-SAT-Formeln (aussagenlogische Formeln in konjunkti...
This book constitutes the refereed proceedings of the 23rd International IFIP conference on Optical Network Design and Modeling, ONDM 2019, held in Athens, Greece, in May 2019. The 39 revised full papers were carefully reviewed and selected from 87 submissions. The papers focus on cutting-edge research in established areas of optical networking as well as their adoption in support of a wide variety of new services and applications. This involves the most recent trends in networking including 5G and beyond, big data and network data analytics, cloud/edge computing, autonomic networking, artificial intelligence assisted networks, secure and resilient networks, that drive the need for increased capacity, efficiency, exibility and adaptability in the functions that the network can perform. In this context new disaggregated optical network architectures were discussed, exploiting and integrating novel multidimensional photonic technology solutions as well as adopting open hardware and software platforms relying on software defined networking (SDN), and network function virtualization (NFV) to allow support of new business models and opportunities.
This book constitutes the refereed proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization, IPCO'99, held in Graz, Austria, in June 1999. The 33 revised full papers presented were carefully reviewed and selected from a total of 99 submissions. Among the topics addressed are theoretical, computational, and application-oriented aspects of approximation algorithms, branch and bound algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diaphantine equations, geometry of numbers, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling, and semidefinite programs.
Modern critical infrastructure is characterized by complex, heterogeneous and dynamically evolving networks. But these can be vulnerable to component failure, and this is a problem which must be addressed by realistic mathematical models. This book presents papers from the NATO Advanced Research Workshop (ARW), Examining Robustness and Vulnerability of Critical Infrastructure Networks, held in Kiev, Ukraine, in June 2013. Contributions were from workshop participants as well as invited experts in the field, and cover topics including: mathematical models; probability-based risk measures; algorithms for the design and detection of robust structures; identification of critical network components and case studies. This book will be of interest to researchers, practitioners and graduate students in the fields of mathematics, computer science and engineering.
This title is written in honor of Manfred Padberg, who has made fundamental contributions to both the theoretical and computational sides of integer programming and combinatorial optimization. This outstanding collection presents recent results in these areas that are closely connected to Padberg's research. His deep commitment to the geometrical approach to combinatorial optimization can be felt throughout this volume; his search for increasingly better and computationally efficient cutting planes gave rise to its title. The peer-reviewed papers contained here are based on invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday. Grouped by topic (packing, stable sets, and perfect graphs; polyhedral combinatorics; general polytopes; semidefinite programming; computation), many of the papers set out to solve challenges set forth in Padberg's work. The book also shows how Padberg's ideas on cutting planes have influenced modern commercial optimization software.
This book offers a collection of original peer-reviewed contributions presented at the 9th International Congress on Design and Modeling of Mechanical Systems (CMSM’2021), held on December 20-22, 2021, in Hammamet, Tunisia. It reports on research findings, advanced methods and industrial applications relating to mechanical systems, materials and structures, and machining. It covers vibration analysis, CFD modeling and simulation, intelligent monitoring and control, including applications related to industry 4.0 and additive manufacturing. Continuing on the tradition of the previous editions, and with a good balance of theory and practice, the book offers a timely snapshot, and a useful resource for both researchers and professionals in the field of design and modeling of mechanical systems.
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity; Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; Elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.In publishing this volume, the editors do not intend to discuss all the classical open problems in combinatorics for which an algebraic approach turns out to be useful. The work is a selection which is intended for specialists, as well as for graduate students who may also be interested in survey papers. The work features a special section which contains a list of unsolved problems proposed by the participants.
Distributed Systems Comprehensive textbook resource on distributed systems—integrates foundational topics with advanced topics of contemporary importance within the field Distributed Systems: Theory and Applications is organized around three layers of abstractions: networks, middleware tools, and application framework. It presents data consistency models suited for requirements of innovative distributed shared memory applications. The book also focuses on distributed processing of big data, representation of distributed knowledge and management of distributed intelligence via distributed agents. To aid in understanding how these concepts apply to real-world situations, the work presents a ...