Discrete Optimization Algorithms

Control of Discrete-event Systems provides a survey of the most important topics in the discrete-event systems theory with particular focus on finite-state automata, Petri nets and max-plus algebra. C

This is an exposition of the theory, techniques, and the basic formulation of structural optimization problems. The author considers applications of design optimization criteria involving strength, ri

Containing exercises and materials that engage students at all levels, Discrete Mathematics with Ducks presents a gentle introduction for students who find the proofs and abstractions of mathematics c

This book provides a thorough understanding of the concepts of optimization methods from a modern perspective at the conceptual stage of complex technical systems. It focuses on nonlinear optimization

"Discrete Event Physics" introduces a new branch of Physics concerned with elucidating the meaning of concepts traditionally studied in that discipline. It is complementary to Mathematical and Experim

This book Algebraic Modeling Systems – Modeling and Solving Real World Optimization Problems – deals with the aspects of modeling and solving real-world optimization problems in a unique combination.

"Industrial applications of evolutionary algorithms" is intended as a resource for both experienced users of evolutionary algorithms and researchers that are beginning to approach these fascinating op

This special volume focuses on optimization and control of processes governed by partial differential equations. The contributors are mostly participants of the DFG-priority program 1253: Optimization

This book?deals with?nonsmooth structures arising within the optimization setting. It considers four optimization problems, namely,?mathematical programs with complementarity constraints, general semi

The vital concept of optimization has been largely neglected in thermal sciences. Keeping this in mind, Essentials of Thermal System Design and Optimization introduces the general principles involved

This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing e

This book constitutes the refereed proceedings of the 12th Algorithms and Data Structures Symposium, WADS 2011, held in New York, NY, USA, in August 2011. The Algorithms and Data Structures Symposium

Semidefinite and conic optimization is a major and thriving research area within the optimization community. Although semidefinite optimization has been studied (under different names) since at least

Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.

Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.

Optimality Conditions in Convex Optimization explores an important and central issue in the field of convex optimization: optimality conditions. It brings together the most important and recent result

The interplay between optimization and machine learning is one of the most importantdevelopments in modern computational science. Optimization formulations and methods are proving tobe vital in design

An up-to-date account of the interplay between optimization and machine learning, accessible to students and researchers in both communities. The interplay between optimization and machine learning

Polyhedral functions provide a model for an important class of problems that includes both linear programming and applications in data analysis. General methods for minimizing such functions using the polyhedral geometry explicitly are developed. Such methods approach a minimum by moving from extreme point to extreme point along descending edges and are described generically as simplicial. The best-known member of this class is the simplex method of linear programming, but simplicial methods have found important applications in discrete approximation and statistics. The general approach considered in this text, first published in 2001, has permitted the development of finite algorithms for the rank regression problem. The key ideas are those of developing a general format for specifying the polyhedral function and the application of this to derive multiplier conditions to characterize optimality. Also considered is the application of the general approach to the development of active se

This textbook presents basic notions and techniques of Fourier analysis in discrete settings. Written in a concise style, it is interlaced with remarks, discussions and motivations from signal analysi

We often come across computational optimization virtually in all branches of engineering and industry. Many engineering problems involve heuristic search and optimization, and, once discretized, may b

Computational Optimization of Internal Combustion Engines presents the state of the art of computational models and optimization methods for internal combustion engine development using multi-dimensio

Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. Connections in Combinatorial Optimization not only includes the most rece

Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded excitin

Discrete Mathematics is designed to serve as a textbook for undergraduate engineering students of computer science and postgraduate students of Computer Applications. The book would also prove useful

Discrete event simulation and agent-based modeling are increasingly recognized as critical for diagnosing and solving process issues in complex systems. Introduction to Discrete Event Simulation and A

Collecting the work of the foremost scientists in the field, Discrete-Event Modeling and Simulation: Theory and Applications presents the state of the art in modeling discrete-event systems using the

This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in math

This book provides an introduction to discrete dynamical systems -- a framework of analysis commonly used in the fields of biology, demography, ecology, economics, engineering, finance, and physics. T

Optimization is a rich and thriving mathematical discipline, and the underlying theory of current computational optimization techniques grows ever more sophisticated. This book aims to provide a conci

Hybrid Optimization focuses on the application of artificial intelligence and operations research techniques to constraint programming for solving combinatorial optimization problems. This book covers

Matters ComputationalThis book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Four

During the past few decades, the gradual merger of Discrete Geometry and the newer discipline of Computational Geometry has provided enormous impetus to mathematicians and computer scientists interested in geometric problems. This 2005 volume, which contains 32 papers on a broad range of topics of interest in the field, is an outgrowth of that synergism. It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension. There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, as well as with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.

This is a long-overdue volume dedicated to space trajectory optimization. Interest in the subject has grown, as space missions of increasing levels of sophistication, complexity, and scientific return - hardly imaginable in the 1960s - have been designed and flown. Although the basic tools of optimization theory remain an accepted canon, there has been a revolution in the manner in which they are applied and in the development of numerical optimization. This volume purposely includes a variety of both analytical and numerical approaches to trajectory optimization. The choice of authors has been guided by the editor's intention to assemble the most expert and active researchers in the various specialities presented. The authors were given considerable freedom to choose their subjects, and although this may yield a somewhat eclectic volume, it also yields chapters written with palpable enthusiasm and relevance to contemporary problems.

The field of discrete calculus, also known as "discrete exterior calculus", focuses on finding a proper set of definitions and differential operators that make it possible to operate the machinery of

In recent years, airline practitioners and academics have started to explore new ways to model airline passenger demand using discrete choice methods. This book provides an introduction to discrete c

Optimization has played a key role in the design, planning and operation of chemical and related processes, for several decades. Global optimization has been receiving considerable attention in the pa

Obtain better system performance, lower energy consumption, and avoid hand-coding arithmetic functions with this concise guide to automated optimization techniques for hardware and software design. High-level compiler optimizations and high-speed architectures for implementing FIR filters are covered, which can improve performance in communications, signal processing, computer graphics, and cryptography. Clearly explained algorithms and illustrative examples throughout make it easy to understand the techniques and write software for their implementation. Background information on the synthesis of arithmetic expressions and computer arithmetic is also included, making the book ideal for newcomers to the subject. This is an invaluable resource for researchers, professionals, and graduate students working in system level design and automation, compilers, and VLSI CAD.

Presenting the first complete treatment of MIMO transceiver optimization, this self-contained book provides all the mathematical information needed to understand transceiver optimization in a single volume. It begins with a review of digital communication fundamentals, and then moves on to a detailed study of joint transceiver optimization, starting from simple single-input single-output channels all the way to minimum bit error rate transceivers for MIMO channels. Crucial background material is covered, such as Schur convex functions, matrix calculus, and constrained optimization, together with eight appendices providing further background material on topics such as matrix theory, random processes, and sampling theory. A final ninth appendix provides a grand summary of all the optimization results. With 360 illustrations, over 70 worked examples, and numerous summary tables provided to aid understanding of key concepts, this book is ideal for graduate students, practitioners, and rese

Ant colony optimization is a metaheuristic - or very generally a form of "black-box" problem-solving algorithm-which has been successfully applied to a wide range of combinatorial optimization problem