You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved in combinatorial optimization.The main part consists of 13 revised full papers on current topics in combinatorial optimization, presented at Aussois 2001, the Fifth Aussois Workshop on Combinatorial Optimization, March 5-9, 2001, and dedicated to Jack Edmonds.Additional highlights in this book are an account of an Aussois 2001 special session dedicated to Jack Edmonds including a speech given by William R. Pulleyblank as well as newly typeset versions of three up-to-now hardly accessible classical papers:- Submodular Functions, Matroids, and Certain Polyhedranbsp;nbsp; by Jack Edmonds- Matching: A Well-Solved Class of Integer Linear Programsnbsp;nbsp; by Jack Edmonds and Ellis L. Johnson- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problemsnbsp;nbsp; by Jack Edmonds and Richard M. Karp.
This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.
This volume contains the proceedings of the Conference on Mathematics and its Applications-2014, held from November 14-17, 2014, at Kuwait University, Safat, Kuwait. Papers contained in this volume cover various topics in pure and applied mathematics ranging from an introductory study of quotients and homomorphisms of C-systems, also known as contextual pre-categories, to the most important consequences of the so-called Fokas method. Also covered are multidisciplinary topics such as new structural and spectral matricial results, acousto-electromagnetic tomography method, a recent hybrid imaging technique, some numerical aspects of sonic-boom minimization, PDE eigenvalue problems, von Neumann...
The Arti?cial Evolution conference was originally conceived as a forum for the French-speaking Evolutionary Computation community, but has of late been acquiring an European audience, with several papers from Germany, Austria, Italy, Spain... However, AE remains as intended a small and friendly gathering, which will continue to be held every two years. Previous AE meets were held in Toulouse, Brest, and Nˆ ?mes. This year, the hosting was done by the LIL (Laboratoire d’Informatique du Littoral) in the not-so-cold city of Dunkerque. The invited talk on “Fitness Landscapes and Evolutionary Algorithms” was delivered by Colin Reeves of Coventry University This volume contains a selection ...
This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7–11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.
The volume presents a survey of the state-of-the-art in artificial evolution, covering theoretical issues, methodologies, and applications in various areas, including genetic-algorithm operators and evolvable hardware and robotics.
Based on a graduate course at the Technische Universität, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The straightforward exposition features many illustrations, and complete proofs for most theorems. With only linear algebra as a prerequisite, it takes the reader quickly from the basics to topics of recent research. The lectures introduce basic facts about polytopes, with an emphasis on methods that yield the results, discuss important examples and elegant constructions, and show the excitement of current work in the field. They will provide interesting and enjoyable reading for researchers as well as students.
This book is a gentle introduction to dominance-based query processing techniques and their applications. The book aims to present fundamental as well as some advanced issues in the area in a precise, but easy-to-follow, manner. Dominance is an intuitive concept that can be used in many different ways in diverse application domains. The concept of dominance is based on the values of the attributes of each object. An object dominates another object if is better than . This goodness criterion may differ from one user to another. However, all decisions boil down to the minimization or maximization of attribute values. In this book, we will explore algorithms and applications related to dominance-based query processing. The concept of dominance has a long history in finance and multi-criteria optimization. However, the introduction of the concept to the database community in 2001 inspired many researchers to contribute to the area. Therefore, many algorithmic techniques have been proposed for the efficient processing of dominance-based queries, such as skyline queries, -dominant queries, and top- dominating queries, just to name a few.