Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science - M Junger - 書籍 - Springer-Verlag Berlin and Heidelberg Gm - 9783540428770 - 2001年11月21日
カバー画像とタイトルが一致しない場合、正しいのはタイトルです

M Junger
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Lecture Notes in Computer Science 2001 edition

価格
¥ 8.907
税抜

遠隔倉庫からの取り寄せ

発送予定日 年6月18日 - 年6月30日

お客様の声：

EU消費者保護法に基づく14日間の返品ポリシー
Trustpilotで高評価
iMusicのウィッシュリストに追加

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches.

Marc Notes: Includes bibliographical references and index. Table of Contents: General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms.- Projection and Lifting in Combinatorial Optimization.- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems.- Lagrangian Relaxation.- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.- Branch, Cut, and Price: Sequential and Parallel.- TSP Cuts Which Do Not Conform to the Template Paradigm. Publisher Marketing: This tutorial contains written versions of seven lectures on computational combinatorial optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modelling are extensively discussed. Applications to prominent combinatorial optimization problems such as production and transport planning, are treated in many places in particular, the book contains an account of the most successful techniques for solving the travelling salesman problem to optimality.

メディア 書籍     Paperback Book   (ソフトカバーで背表紙を接着した本)
リリース済み 2001年11月21日
ISBN13 9783540428770
出版社 Springer-Verlag Berlin and Heidelberg Gm
ページ数 310
寸法 216 × 279 × 17 mm   ·   449 g
言語 ドイツ語  
編集者 Junger, Michael
編集者 Naddef, Denis

M Jungerの他の作品を見る

すべて表示

Mere med samme udgiver

M Jungerのすべてを見る ( 例： Paperback Book )