Integrated Methods for Optimization (International Series in Operations Research & Management Science, Vol. 170)
暫譯: 優化的綜合方法(國際運籌學與管理科學系列,第170卷)

John N. Hooker

  • 出版商: Springer
  • 出版日期: 2011-11-12
  • 售價: $2,450
  • 貴賓價: 9.5$2,328
  • 語言: 英文
  • 頁數: 642
  • 裝訂: Hardcover
  • ISBN: 1461418992
  • ISBN-13: 9781461418993
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

The first edition of Integrated Methods for Optimization was published in January 2007. Because the book covers a rapidly developing field, the time is right for a second edition. The book provides a unified treatment of optimization methods. It brings ideas from mathematical programming (MP), constraint programming (CP), and global optimization (GO)into a single volume. There is no reason these must be learned as separate fields, as they normally are, and there are three reasons they should be studied together. (1) There is much in common among them intellectually, and to a large degree they can be understood as special cases of a single underlying solution technology. (2) A growing literature reports how they can be profitably integrated to formulate and solve a wide range of problems. (3) Several software packages now incorporate techniques from two or more of these fields.

The book provides a unique resource for graduate students and practitioners who want a well-rounded background in optimization methods within a single course of study. Engineering students are a particularly large potential audience, because engineering optimization problems often benefit from a combined approach―particularly where design, scheduling, or logistics are involved. The text is also of value to those studying operations research, because their educational programs rarely cover CP, and to those studying computer science and artificial intelligence (AI), because their curric

ula typically omit MP and GO. The text is also useful for practitioners in any of these areas who want to learn about another, because it provides a more concise and accessible treatment than other texts.

The book can cover so wide a range of material because it focuses on ideas that arerelevant to the methods used in general-purpose optimization and constraint solvers. The book focuses on ideas behind the methods that have proved useful in general-purpose optimization and constraint solvers, as well as integrated solvers of the present and foreseeable future.  The second edition updates results in this area and includes several major new topics:

  • Background material in linear, nonlinear, and dynamic programming.
  • Network flow theory, due to its importance in filtering algorithms.
  • A chapter on generalized duality theory that more explicitly develops a unifying primal-dual algorithmic structure for optimization methods.
  • An extensive survey of search methods from both MP and AI, using the primal-dual framework as an organizing principle.
  • Coverage of several additional global constraints used in CP solvers.

The book continues to focus on exact as opposed to heuristic methods. It is possible to bring heuristic methods into the unifying scheme described in the book, and the new edition will retain the brief discussion of how this might be done.

商品描述(中文翻譯)

第一版的《整合優化方法》於2007年1月出版。由於本書涵蓋了一個快速發展的領域,因此現在是出版第二版的適當時機。本書提供了優化方法的統一處理,將數學規劃(Mathematical Programming, MP)、約束規劃(Constraint Programming, CP)和全局優化(Global Optimization, GO)的理念整合到一本書中。這些領域不必像通常那樣被視為獨立的學科,並且有三個理由應該一起學習它們:(1)在智識上,它們之間有許多共同之處,在很大程度上可以理解為單一基礎解決技術的特例。(2)不斷增長的文獻報告了如何將它們有效整合,以制定和解決各種問題。(3)現在有幾個軟體包已經整合了這些領域中的兩個或更多技術。

本書為研究生和實務工作者提供了一個獨特的資源,適合希望在單一學習課程中獲得全面優化方法背景的人士。工程學生是一個特別大的潛在讀者群,因為工程優化問題通常受益於綜合方法,特別是在設計、排程或物流相關的情況下。本書對於學習運籌學的人士也具有價值,因為他們的教育課程很少涵蓋CP,對於學習計算機科學和人工智慧(AI)的人士來說也同樣適用,因為他們的課程通常省略了MP和GO。本書對於任何希望了解其他領域的實務工作者也很有用,因為它提供了比其他書籍更簡潔且易於理解的處理方式。

本書能涵蓋如此廣泛的材料,因為它專注於與通用優化和約束求解器中使用的方法相關的理念。本書著重於那些在通用優化和約束求解器中被證明有用的方法背後的理念,以及當前和可預見未來的整合求解器。第二版更新了該領域的結果,並包括幾個主要的新主題:
- 線性、非線性和動態規劃的背景材料。
- 由於其在過濾算法中的重要性,網絡流理論。
- 一章關於廣義對偶理論,更明確地發展了優化方法的統一原始-對偶算法結構。
- 從MP和AI中進行的搜索方法的廣泛調查,使用原始-對偶框架作為組織原則。
- 涵蓋CP求解器中使用的幾個額外全局約束。

本書繼續專注於精確方法而非啟發式方法。可以將啟發式方法納入本書所描述的統一方案中,新的版本將保留簡要討論如何實現這一點。