Over the past several years, cooperative control and optimization has un questionably been established as one of the most important areas of research in the military sciences. Even so, cooperative control and optimization tran scends the military in its scope -having become quite relevant to a broad class of systems with many exciting, commercial, applications. One reason for all the excitement is that research has been so incredibly diverse -spanning many scientific and engineering disciplines. This latest volume in the Cooperative Systems book series clearly illustrates this trend towards diversity and creative thought. And no wonder, cooperative systems are among the hardest systems control science has endeavored to study, hence creative approaches to model ing, analysis, and synthesis are a must! The definition of cooperation itself is a slippery issue. As you will see in this and previous volumes, cooperation has been cast into many different roles and therefore has assumed many diverse meanings. Perhaps the most we can say which unites these disparate concepts is that cooperation (1) requires more than one entity, (2) the entities must have some dynamic behavior that influences the decision space, (3) the entities share at least one common objective, and (4) entities are able to share information about themselves and their environment. Optimization and control have long been active fields of research in engi neering.

Across the globe, the past several years have seen a tremendous increase in the role of cooperative autonomous systems. The field of cooperative control and optimization has established itself as a part of many different scientific disciplines. The contents of this hugely important volume, which adds much to the debate on the subject, are culled from papers presented at the Seventh Annual International Conference on Cooperative Control and Optimization, held in Gainesville, Florida, in January 2007.

Cooperative, collaborating autonomous systems are at the forefront of research efforts in numerous disciplines across the applied sciences. There is constant progress in solution techniques for these systems. However, despite this progress, cooperating systems have continued to be extremely difficult to model, analyze, and solve. Theoretical results are very difficult to come by. Each year, the International Conference on Cooperative Control and Optimization (CCO) brings together top researchers from around the world to present new, cutting-edge, ideas, theories, applications, and advances in the fields of autonomous agents, cooperative systems, control theory, information flow, and optimization. The works in this volume are a result of invited papers and selected presentations at the Eighth Annual International Conference on Cooperative Control and Optimization, held in Gainesville, Florida, January 30 – February 1, 2008.

In a world with highly competitive markets and economic instability due to capitalization, industrial competition has increasingly intensified. In order for many industries to survive and succeed, they need to develop highly effective coordination between supply chain partners, dynamic collaborative and strategic alliance relationships, and efficient logistics and supply chain network designs. Consequently, in the past decade, there has been an explosion of interest among academic researchers and industrial practitioners in innovative supply chain and logistics models, algorithms, and coordination policies. Mathematically distinct from classical supply chain management, this emerging research area has been proven to be useful and applicable to a wide variety of industries. This book brings together recent advances in supply chain and logistics research and computational optimization that apply to a collaborative environment in the enterprise.

Cooperative, collaborating autonomous systems are at the forefront of research efforts in numerous disciplines across the applied sciences. There is constant progress in solution techniques for these systems. However, despite this progress, cooperating systems have continued to be extremely difficult to model, analyze, and solve. Theoretical results are very difficult to come by. Each year, the International Conference on Cooperative Control and Optimization (CCO) brings together top researchers from around the world to present new, cutting-edge, ideas, theories, applications, and advances in the fields of autonomous agents, cooperative systems, control theory, information flow, and optimization. The works in this volume are a result of invited papers and selected presentations at the Eighth Annual International Conference on Cooperative Control and Optimization, held in Gainesville, Florida, January 30 – February 1, 2008.

Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area. "Mathematical Aspects of Network Routing Optimization" focuses on computational issues arising from the process of optimizing network routes, such as quality of the resulting links and their reliability. Algorithms are a cornerstone for the understanding of the protocols underlying multicast routing. The main objective in the text is to derive efficient algorithms, with or without guarantee of approximation. Notes have been provided for basic topics such as graph theory and linear programming to assist those who are not fully acquainted with the mathematical topics presented throughout the book. "Mathematical Aspects of Network Routing Optimization" provides a thorough introduction to the subject of algorithms for network routing, and focuses especially on multicast and wireless ad hoc systems. This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks. It is suitable for advanced undergraduate students, graduate students, and researchers in the area of network algorithms.