株式会社極東書店トップ商品一覧Bandpass and Band Collocation Problems: Theory and Algorithms.

商品詳細

Bandpass and Band Collocation Problems: Theory and Algorithms.

Bandpass and Band Collocation Problems: Theory and Algorithms.

・ISBN 978-1-041-28087-3 hard GB£ 103.99

¥32,943.- (税込) (※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。

お気に入り
著者・編者Nuriyev, Urfat / Kutucu, Hakan / Guersoy, Arif / Kurt, Mehmet,
出版社 (CRC Press, UK)
出版年月2027
ページ数200 pp.
言語ENG
ニュース番号<A05-93013>

解説

This book addresses two critical combinatorial optimization problems in fiber optic network design. It provides the first unified treatment of bandpass and band collocation problems, which emerge from wavelength division multiplexing technology in optical communications.

Bandpass and Band Collocation Problems: Theory and Algorithms offers several key advantages that establish it as an indispensable reference in the field. Its originality as the first comprehensive treatment of these problems fills a significant academic gap, while its unified approach consolidates scattered literature under a single theoretical framework. The text provides exceptional academic depth through NP-completeness proofs, complexity analyses, and detailed examination of exact, heuristic, and meta-heuristic algorithms. Readers benefit from clear connections between theoretical problems and real-world telecommunications applications, systematic classification of all existing literature studies, and access to online problem instance libraries for comparative research. Additionally, the book identifies open research areas and proposes new directions, making it valuable for both learning and advancing the field.

The primary audience for this book is graduate-level academics and researchers, particularly those in telecommunications engineering, and computer engineering disciplines. Secondary markets include algorithm developers and network planning specialists in the telecommunications sector, software engineers involved in optical network design, mathematical modeling teams in high-technology R&D companies, and open-source algorithm development communities seeking benchmark problems and solutions for comparative studies.