This book focus on the theory and practice of discrete optimization. The book contains an explanation of many different continuous and discrete algorithms designed for optimizing different problems and applications. The subjects addressed in this book are important for both mathematics and computer science researchers. I hope that the readers of this book will find many fruitful ideas for their own future research in the field of discrete optimization.Discrete optimization is an important area of applied mathematics that is at the intersection of several disciplines and covers both theoretical and practical aspects. I present new theoretical results, structural investigations, new models, and algorithmic approaches, as well as new applications of discrete optimization problems. Among the possible subjects, integer programming, combinatorial optimization, optimization problems on graphs and networks, scheduling, and logistics are mentioned, to name a few. This book is of high quality, reflecting the great interest in the area of discrete optimization.
Auflage
Sprache
Verlagsort
Newcastle upon Tyne
Großbritannien
Zielgruppe
Editions-Typ
Produkt-Hinweis
Maße
Höhe: 212 mm
Breite: 148 mm
ISBN-13
978-1-0364-5311-4 (9781036453114)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Ehab Morsy was born in Egypt on January 8, 1974. He received B.S. and M.S. degrees from the Department of Mathematics and Computer Science, Suez Canal University, Ismailia, Egypt, in 1996, and in 2002, respectively. He received a PhD degree from the Graduate School of Informatics, Kyoto University, Kyoto, Japan in 2009. Currently, he is appointed as an associate Professor at the Department of Mathematics, Suez Canal University, Ismailia, Egypt. His research interests include Discrete Optimization, Algorithms design and Analysis, Graph Algorithms, Combinatorial Optimization, Network Routing Problems, Scheduling Problems, and Distributed Algorithms.