You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrcken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the S...
Our objectives in writing Project Scheduling: A Research Handbook are threefold: (1) Provide a unified scheme for classifying the numerous project scheduling problems occurring in practice and studied in the literature; (2) Provide a unified and up-to-date treatment of the state-of-the-art procedures developed for their solution; (3) Alert the reader to various important problems that are still in need of considerable research effort. Project Scheduling: A Research Handbook has been divided into four parts. Part I consists of three chapters on the scope and relevance of project scheduling, on the nature of project scheduling, and finally on the introduction of a unified scheme that will be u...
This volume contains the accounts of the principal survey papers presented at GRAPHS and ORDER, held at Banff, Canada from May 18 to May 31, 1984. This conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the University of Calgary. We are grateful for all of this considerable support. Almost fifty years ago the first Symposium on Lattice Theory was held in Charlottesville, U.S.A. On that occasion the principal lectures were delivered by G. Birkhoff, O. Ore and M.H. Stone. In those days the theory of ordered sets was thought to be a vigorous relative of group theory. Some twenty-five years ago the Symposium on Partially Ordered Sets and Lattice Theory was held in Monterey, U.S.A. Among the principal speakers at that meeting were R.P. Dilworth, B. Jonsson, A. Tarski and G. Birkhoff. Lattice theory had turned inward: it was concerned primarily with problems about lattices themselves. As a matter of fact the problems that were then posed have, by now, in many instances, been completely solved.
Bonn Workshop on Combinatorial Optimization
Sustainable Entrepreneurship stands for a business driven concept of sustainability which focusses on increasing both social as well as business value - so called Shared Value. This book shows why and how this unique concept has the potential to become the most recognised strategic management approach in our times. It aims to point out the opportunities that arise from putting sustainable entrepreneurship into practice. At the same time, this book is a wake-up call for all those companies and decision makers who underestimated Sustainable Entrepreneurship before or who are simply not aware of its greater dimension. Well structured chapters from different academic and business perspectives cl...
Environmental informatics is a field of applied computer science that develops and uses the techniques of information processing for environmental protection, research and engineering. The multidisciplinary nature of environmental problems needs environmental informatics as a bridge and mediator between many disciplines and institutions. The present book presents a wide range of topics currently being pursued in the area, including basic methodological issues and typical applications. A significant number of recognised experts have contributed to the volume, discussing the methodology and application of environmental monitoring, environmental databases and information systems, GIS, modeling software, environmental management systems, knowledge-based systems, and the visualisation of complex environmental data. For scholarly and professional practitioners of environmental management who wish to acquire well-founded knowledge of environmental information processing and specialists in applied computer science who wish to learn more about the contribution of their field to the solution of our urgent environmental problems.
For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new fast developing area shows the wide range of its applicability.Specifically, the book contains contributions in the following fields: semigroup and semiring theory applied to combinatorial and integer programming, network flow theory in ordered algebraic structures, extremal optimization problems, decomposition principles for discrete structures, Boolean methods in graph theory and applications.
This volume contains selected papers presented either at the Oberwolfach Conference on Operations Research, February 1987, or at the three-day workshop on Advanced Computation Techniques, Parallel Processing and Optimization organized by IIASA and the University of Karlsruhe, which immediately followed. The aim of the conferences was to discuss recently developed methods in optimization theory and their practical implementation using advanced computation techniques, especially in parallel processing. The volume is divided into five sections: I. Algorithms and Optimization Methods II. Optimization and Parallel Processing III. Graph Theory and Scheduling IV. Differential Equations and Operator Theory V. Applications.
The sixth edition provides expanded Discussion and Comments and References sections at the end of each chapter, creating a spotlight on practical applications of the theory presented in that chapter. New topics include rules for stochastic parallel machine scheduling and for stochastic online scheduling, models of flow shops with reentry, fixed parameter tractability, and new designs and implementations of scheduling systems. The main structure of the book as per previous edition consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing ...