Автор: Vanderbei, Robert J. Название: Linear programming ISBN: 1461476291 ISBN-13(EAN): 9781461476290 Издательство: Springer Цена: 13974.00 р. Наличие на складе: Поставка под заказ. Описание: This Fourth Edition introduces the latest theory and applications in optimization. It emphasizes constrained optimization, beginning with a substantial treatment of linear programming and then proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Readers will discover a host of practical business applications as well as non-business applications.
Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, primal-dual simplex method, path-following interior-point method, and homogeneous self-dual methods.
In addition, the author provides online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's website. The website also includes new online instructional tools and exercises.
Автор: Bazaraa Название: Linear Programming and Network Flows 4 ed. ISBN: 0470462728 ISBN-13(EAN): 9780470462720 Издательство: Wiley Рейтинг: Цена: 19634.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Linear Programming and Network Flows presents the problem of minimizing and maximizing a linear function in the presence of linear equality or inequality constraints. This text provides methods for modeling complex problems via effective algorithms on modern computers, optimization problems, and effective solution algorithms.
Автор: Matousek Название: Understanding and using linear programming ISBN: 3540306978 ISBN-13(EAN): 9783540306979 Издательство: Springer Рейтинг: Цена: 8384.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The book is an introductory textbook mainly for students of computer science and mathematics. Our guiding phrase is "what every theoretical computer scientist should know about linear programming". A major focus is on applications of linear programming, both in practice and in theory. The book is concise, but at the same time, the main results are covered with complete proofs and in sufficient detail, ready for presentation in class. The book does not require more prerequisites than basic linear algebra, which is summarized in an appendix. One of its main goals is to help the reader to see linear programming "behind the scenes".
Описание: This book analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, and linear summation (or counting). The book provides some new insights on duality concepts for integer programs.
Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.
Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).
On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.
Автор: Schrijver, Alexander Название: Theory of linear and integer programming ISBN: 0471982326 ISBN-13(EAN): 9780471982326 Издательство: Wiley Рейтинг: Цена: 13773.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
