عنوان

Iterative methods in combinatorial optimization /

شابک

0521189438 (pbk.)

شابک

1107007518 (hardback)

شابک

9780521189439 (pbk.)

شابک

9781107007512 (hardback)

شماره

dltt

عنوان اصلي

Iterative methods in combinatorial optimization /

نام عام مواد

[Book]

نام نخستين پديدآور

Lap Chi Lau, R. Ravi, Mohit Singh

محل نشرو پخش و غیره

New York :

نام ناشر، پخش کننده و غيره

Cambridge University Press,

تاریخ نشرو بخش و غیره

2011

نام خاص و کميت اثر

xi, 242 p. :

ساير جزييات

ill. ;

ابعاد

24 cm

عنوان فروست

Cambridge texts in applied mathematics

متن يادداشت

Includes bibliographical references and index

متن يادداشت

"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--

متن يادداشت

"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--

موضوع مستند نشده

Combinatorial optimization

موضوع مستند نشده

Iterative methods (Mathematics)

شماره

ويراست

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Lau, Lap Chi

مستند نام اشخاص تاييد نشده

Ravi, R., (Ramamoorthi),1969-

مستند نام اشخاص تاييد نشده

Singh, Mohit

تاريخ عمليات

20110523234304.0

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y