Mendeley出力
＜図書＞
The traveling salesman problem : a computational study
| 責任表示 | David L. Applegate, Robert E. Bixby ... [et al.] |
|---|---|
| シリーズ | Princeton series in applied mathematics |
| データ種別 | 図書 |
| 出版情報 | Princeton : Princeton University Press , c2006 |
| 本文言語 | 英語 |
| 大きさ | ix, 593 p. : ill., maps ; 24 cm |
| 概要 | "This book addresses one of the most famous and important combinatorial-optimization problems--the traveling salesman problem. It is very well written, with a vivid style that captures the reader's a...tention. Many examples are provided that are very useful to motivate and help the reader to better understand the results presented in the book."--Matteo Fischetti, University of Padova "This is a fantastic book. Ever since the early days of discrete optimization, the traveling salesman problem has served as the model for computationally hard problems. The authors are main players in this area who forged a team in 1988 to push the frontiers on how good we are in solving hard and large traveling salesman problems. Now they lay out their views, experience, and findings in this book."--Bert Gerards, Centrum voor Wiskunde en Informatica 続きを見る |
| 電子版へのリンク | https://hdl.handle.net/2324/6836590 |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
理系図3F 数理独自 | APPL/20/1 | 2006 |
|
023212006007912 |
|
書誌詳細
| 一般注記 | Includes bibliographical references (p. [541]-581) and index |
|---|---|
| 著者標目 | Applegate, David L. Bixby, Robert E. |
| 件 名 | LCSH:Combinatorial optimization LCSH:Traveling-salesman problem |
| 分 類 | NDLC:MA216 |
| 書誌ID | 1001237276 |
| ISBN | 0691129932 |
| NCID | BA80616090 |
| 巻冊次 | ISBN:0691129932 ; XISBN:9780691129938 |
| 登録日 | 2009.09.18 |
| 更新日 | 2009.11.02 |