Discrete Diversity And Dispersion Maximization

This book demonstrates the metaheuristic methodologies that apply to maximum diversity problems to solve them. Maximum diversity problems arise in many practical settings from facility location to social network analysis and constitute an important class of NP-hard problems in combinatorial optimization. In fact, this volume presents a “missing link” in the combinatorial optimization-related literature. In providing the basic principles and fundamental ideas of the most successful methodologies for discrete optimization, this book allows readers to create their own applications for other discrete optimization problems. Additionally, the book is designed to be useful and accessible to researchers and practitioners in management science, industrial engineering, economics, and computer science, while also extending value to non-experts in combinatorial optimization. Owed to the tutorials presented in each chapter, this book may be used in a master course, a doctoral seminar, or as supplementary to a primary text in upper undergraduate courses. The chapters are divided into three main sections. The first section describes a metaheuristic methodology in a tutorial style, offering generic descriptions that, when applied, create an implementation of the methodology for any optimization problem. The second section presents the customization of the methodology to a given diversity problem, showing how to go from theory to application in creating a heuristic. The final part of the chapters is devoted to experimentation, describing the results obtained with the heuristic when solving the diversity problem. Experiments in the book target the so-called MDPLIB set of instances as a benchmark to evaluate the performance of the methods.

This book constitutes the proceedings of the 21st International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2022, held in Petrozavodsk, Russia, in July 2022. The 21 full papers presented together with 6 invited abstracts lectures and 2 tutorial abstracts in this volume were carefully reviewed and selected from 88 submissions. The conference focuses on the following topics: Mathematical programming, bi-level and global optimization, integer programming and combinatorial optimization, approximation algorithms with theoretical guarantees and approximation schemes, heuristics and meta-heuristics, game theory, optimal control, optimization in machine learning and data analysis, and their valuable applications in operations research and economics.

This comprehensive volume presents essential mathematical results devoted to topics of mathematical analysis, differential equations and their various applications. It focuses on differential operators, Wardowski maps, low-oscillation functions, Galois and Pataki connections, Hardy-type inequalities, to name just a few.Effort has been made for this unique title to have an interdisciplinary flavor and features several applications such as in tomography, elastic scattering, fluid mechanics, etc.This work could serve as a useful reference text to benefit professionals, academics and graduate students working in theoretical computer science, computer mathematics, and general applied mathematics.

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems. Due to the Corona pandemic this event was held virtually.

As a result of higher frequencies and increased user mobility, researchers and systems designers are shifting their focus from time-invariant models to channels that vary within a block. Wireless Communications Over Rapidly Time-Varying Channels explains the latest theoretical advances and practical methods to give an understanding of rapidly time varying channels, together with performance trade-offs and potential performance gains, providing the expertise to develop future wireless systems technology. As well as an overview of the issues of developing wireless systems using time-varying channels, the book gives extensive coverage to methods for estimating and equalizing rapidly time-varying channels, including a discussion of training data optimization, as well as providing models and transceiver methods for time-varying ultra-wideband channels. An introduction to time-varying channel models gives in a nutshell the important issues of developing wireless systems technology using time-varying channels Extensive coverage of methods for estimating and equalizing rapidly time-varying channels, including a discussion of training data optimization, enables development of high performance wireless systems Chapters on transceiver design for OFDM and receiver algorithms for MIMO communication channels over time-varying channels, with an emphasis on modern iterative turbo-style architectures, demonstrates how these important technologies can optimize future wireless systems

Faced with the challenge of solving hard optimization problems that abound in the real world, classical methods often encounter great difficulty - even when equipped with a theoretical guarantee of finding an optimal solution. Vitally important applications in business, engineering, economics and science cannot be tackled with any reasonable hope of success, within practical time horizons, by solution methods that have been the predominant focus of academic research throughout the past three decades (and which are still the focus of many textbooks). The impact of technology and the advent of the computer age have presented us with the need (and opportunity) to solve a range of problems that could scarcely have been envisioned in the past. Weare confronted with applications that span the realms of resource planning, telecommunications, VLSI design, fmancial analysis, scheduling, space planning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management, mineral exploration, biomedical analysis, environmental conservation and scores of others.

Thi s book ari ses from The Fourth European Coll oqui urn on Theoret i ca 1 and Quant itat i ve Geography wh i ch was he 1 din Ve 1 dhoven, The Netherlands in September 1985. It contains a series of papers on spatial choice dynamics and dynamical spatial systems which were presented at the colloquium, together with a few other soll icited ones. The book is intended primarily as a state-of-the art review of mainly European research on these two fastly growing problem areas. As a consequence of this decision, the book contains a selection of papers that differs in terms of focus, level of sophistication and conceptual background. Evidently, the dissimination of ideas and computer software is a time-related phenomenon, which in the European context is amplified by differences in language, the profile of geography and the formal training of geographers. The book reflects such differences. It would have been impossible to produce this book without the support of the various European study groups on theoretical and quantitative geography. Without their help the meetings from which this volumes originates would not have been held in the first place. We are also indebted to the Royal Dutch Academy of Science for partly funding the colloquium, and to SISWO and TNOjPSC for providing general support in the organisation of the conference.

The book Scatter Search by Manuel Laguna and Rafael Martí represents a long-awaited "missing link" in the literature of evolutionary methods. Scatter Search (SS)-together with its generalized form called Path Relinking-constitutes the only evolutionary approach that embraces a collection of principles from Tabu Search (TS), an approach popularly regarded to be divorced from evolutionary procedures. The TS perspective, which is responsible for introducing adaptive memory strategies into the metaheuristic literature (at purposeful level beyond simple inheritance mechanisms), may at first seem to be at odds with population-based approaches. Yet this perspective equips SS with a remarkably effective foundation for solving a wide range of practical problems. The successes documented by Scatter Search come not so much from the adoption of adaptive memory in the range of ways proposed in Tabu Search (except where, as often happens, SS is advantageously coupled with TS), but from the use of strategic ideas initially proposed for exploiting adaptive memory, which blend harmoniously with the structure of Scatter Search. From a historical perspective, the dedicated use of heuristic strategies both to guide the process of combining solutions and to enhance the quality of offspring has been heralded as a key innovation in evolutionary methods, giving rise to what are sometimes called "hybrid" (or "memetic") evolutionary procedures. The underlying processes have been introduced into the mainstream of evolutionary methods (such as genetic algorithms, for example) by a series of gradual steps beginning in the late 1980s.