Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

THE RECTILINEAR STEINER TREE PROBLEM: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE RECTILINEAR STEINER TREE PROBLEM - Nahit Emanet

inglise keel
2010-03-01
46,16 € 76,94 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

The rectilinear Steiner tree problem is an NP- complete problem with many important applications in networks and very large scale integration (VLSI) design. This book examines the rectilinear Steiner tree problem and proposes sequential and parallel branch and cut algorithms to solve it. In this book, we present two new LP constraints: cutsec constraints and strong incompatibility constraints allow us to gr ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

The rectilinear Steiner tree problem is an NP- complete problem with many important applications in networks and very large scale integration (VLSI) design. This book examines the rectilinear Steiner tree problem and proposes sequential and parallel branch and cut algorithms to solve it. In this book, we present two new LP constraints: cutsec constraints and strong incompatibility constraints allow us to greatly reduce the time to solve the problem. We also present a message passing parallel algorithm to solve large problem instances in an heterogenous computing environment.

Lisateave

Autor Nahit Emanet
Kirjastaja LAP LAMBERT Academic Publishing
Väljalaskeaasta 2010
Kaanetüüp Pehme kaanega
EAN 9783838349060
Kirjuta oma arvustus
Te vaatate: THE RECTILINEAR STEINER TREE PROBLEM: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE RECTILINEAR STEINER TREE PROBLEM
Teie hinnang:

Goodreads'i arvustused

46,16 € 76,94 €