Nonlinear Assignment Problems - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Nonlinear Assignment Problems write by Panos M. Pardalos. This book was released on 2013-03-09. Nonlinear Assignment Problems available in PDF, EPUB and Kindle. Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem, and despite the efforts of many researchers over the past three decades, they still remain some of the hardest combinatorial optimization problems to solve exactly. The purpose of this book is to provide in a single volume, major algorithmic aspects and applications of NAPs as contributed by leading international experts. The chapters included in this book are concerned with major applications and the latest algorithmic solution approaches for NAPs. Approximation algorithms, polyhedral methods, semidefinite programming approaches and heuristic procedures for NAPs are included, while applications of this problem class in the areas of multiple-target tracking in the context of military surveillance systems, of experimental high energy physics, and of parallel processing are presented. Audience: Researchers and graduate students in the areas of combinatorial optimization, mathematical programming, operations research, physics, and computer science.
On Some Nonlinear Assignment Problems
On Some Nonlinear Assignment Problems - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook On Some Nonlinear Assignment Problems write by Vladyslav Sokol. This book was released on 2018. On Some Nonlinear Assignment Problems available in PDF, EPUB and Kindle. Linear assignment problem (commonly referred to as just assignment problem) is a fundamental problem in combinatorial optimization. The goal is to assign n workers to do n jobs so that the linear sum of corresponding costs is minimized. The linear assignment problem is thoroughly studied and has a O(n^3) solution with Hungarian algorithm. Nevertheless, a wide range of applications involving assignments are naturally modeled with more complex objective functions (for example quadratic sum as in quadratic assignment problem), and are much more computationally challenging. In this thesis we discuss our results on the bilinear assignment problem, which generalizes the quadratic assignment problem, and is also motivated by several unique applications. The focus is on computational complexity, solvable special cases, approximations, linearizations as well as local search algorithms and other heuristic approaches for the problem. We also present our results on few applied projects, where modelling the underlying problem as a nonlinear assignment was instrumental.
Algorithms for Nonlinear Assignment Problems
Algorithms for Nonlinear Assignment Problems - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Algorithms for Nonlinear Assignment Problems write by Leonidas S. Pitsoulis. This book was released on 1998. Algorithms for Nonlinear Assignment Problems available in PDF, EPUB and Kindle.
Linear Programs and Related Problems
Linear Programs and Related Problems - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Linear Programs and Related Problems write by Evar D. Nering. This book was released on 1993. Linear Programs and Related Problems available in PDF, EPUB and Kindle. This text is concerned primarily with the theory of linear and nonlinear programming, and a number of closely-related problems, and with algorithms appropriate to those problems. In the first part of the book, the authors introduce the concept of duality which serves as a unifying concept throughout the book. The simplex algorithm is presented along with modifications and adaptations to problems with special structures. Two alternative algorithms, the ellipsoidal algorithm and Karmarker's algorithm, are also discussed, along with numerical considerations. the second part of the book looks at specific types of problems and methods for their solution. This book is designed as a textbook for mathematical programming courses, and each chapter contains numerous exercises and examples.
Assignment Problems, Revised Reprint
Assignment Problems, Revised Reprint - read free eBook in online reader or directly download on the web page. Select files or add your book in reader. Download and read online ebook Assignment Problems, Revised Reprint write by Rainer E. Burkard. This book was released on 2009-01-01. Assignment Problems, Revised Reprint available in PDF, EPUB and Kindle. This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated webpage offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. Researchers will benefit from the book's detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its many variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.
