Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization, Levent Tuncel

Автор: Miguel F. Anjos; Jean B. Lasserre
Название: Handbook on Semidefinite, Conic and Polynomial Optimization
ISBN: 1489978038 ISBN-13(EAN): 9781489978035
Издательство: Springer
Рейтинг:
Цена: 222670.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.

Автор: G?rtner, Matousek
Название: Approximation Algorithms and Semidefinite Programming
ISBN: 3642220142 ISBN-13(EAN): 9783642220142
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.  There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

Автор: E. de Klerk
Название: Aspects of Semidefinite Programming
ISBN: 1441952160 ISBN-13(EAN): 9781441952165
Издательство: Springer
Рейтинг:
Цена: 158340.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Semidefinite programming has been described as linear programming for the year 2000. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.In this monograph the basic theory of interior point algorithms is explained.

Автор: Nik Pachis
Название: Polyhedral and Algebraic Methods in Computational Geometry
ISBN: 1681174499 ISBN-13(EAN): 9781681174495
Издательство: Gazelle Book Services
Рейтинг:
Цена: 203050.00 T
Наличие на складе: Невозможна поставка.
Описание: Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with history stretching back to antiquity. The main impetus for the development of computational geometry as a discipline was progress in computer graphics and computer-aided design and manufacturing (CAD/CAM), but many problems in computational geometry are classical in nature, and may come from mathematical visualization. Other important applications of computational geometry include robotics, geographic information systems, integrated circuit design, computer-aided engineering, and computer vision. Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. This book is directed towards advanced undergraduates in mathematics and computer science, as well as towards engineering students who are interested in the applications of computational geometry.

Автор: Osborne
Название: Simplicial Algorithms for Minimizing Polyhedral Functions
ISBN: 1107403502 ISBN-13(EAN): 9781107403505
Издательство: Cambridge Academ
Рейтинг:
Цена: 40130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, first published in 2001, provides a general account of the development of simplicial algorithms. These include the ubiquitous simplex method of linear programming, widely used in industrial optimization and strategic decision making. They also include methods important in data analysis, such as problems involving very large data sets.

Автор: Mircea Vasile Diudea
Название: Multi-shell Polyhedral Clusters
ISBN: 3319641212 ISBN-13(EAN): 9783319641218
Издательство: Springer
Рейтинг:
Цена: 139750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume presents new methodologies and rationalizes existing methods that are used in the design of multi-shell polyhedral clusters. The author goes on to show how the recently established methods are used for building complex multi-shell nanostructures and how this completes the existing information in the field.

Автор: Egon Balas; Jens Clausen
Название: Integer Programming and Combinatorial Optimization
ISBN: 3540594086 ISBN-13(EAN): 9783540594086
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume represents the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, (IPCO) in 1995. Theoretical and algorithmic basics for the solution of optimization problems such as production planning, are presented.