The linear ordering problem : exact and heuristic methods in combinatorial optimization

著者

書誌事項

The linear ordering problem : exact and heuristic methods in combinatorial optimization

Rafael Martí, Gerhard Reinelt

(Applied mathematical sciences, 175)

Springer, c2011

  • : hbk

大学図書館所蔵 件 / 21

この図書・雑誌をさがす

内容説明・目次

内容説明

Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.

目次

1 Introduction.- 2 Heuristic Methods.- 3 Meta-Heuristics.- 4 Branch-and-Bound.- 5 Branch-and-Cut.- 6 The Linear Ordering Polytope.- 7 Further Aspects.- References.- Index.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BB04783578
  • ISBN
    • 9783642167287
  • 出版国コード
    gw
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    Berlin
  • ページ数/冊数
    xii, 171 p.
  • 大きさ
    24 cm
  • 分類
  • 件名
  • 親書誌ID
ページトップへ