Dingzhu Du – författare

Classical minimax theory (von Neumann), duality and saddle point analysis have together played a critical role in optimization and game theory. It is currently recognized that minimax problems and techniques appear throughout a broad spectrum of disciplines, including game theory, optimization, and computational complexity. Many interesting and sophisticated problems are formulated as minimax applications, as in the fields of combinatorial optimization, scheduling, location, packing, searching, and triangulation. The contributions to this text cover a wide range of topics and provide a clear picture of recent research and developments in minimax theory. It is aimed at graduate students as well as researchers in optimization, computer science, and related areas.

This volume can be considered as a supplementary volume to the three-volume "Handbook of Combinatorial Optimization" published by Kluwer. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject including optimization problems and algorithmic approaches for discrete problems. This handbook deals with several algorithmic approaches for discrete problems as well as with many combinatorial optimization problems. Each chapter in the handbook is expository in nature, but scholarly in treatment. The book is addressed not only to researchers in discrete optimization, but to all scientists in various disciplines who use combinatorial optimization methods to model and solve problems.

This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization;