The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem - Nahit Emanet - Bøker - LAP Lambert Academic Publishing - 9783838349060 - 29. juni 2010
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Nahit Emanet
The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem

Pris
NOK 449

Bestillingsvarer

Forventes levert 24. jun - 2. jul

Kundene våre sier:

14 dages returrett
Toppvurdering på Trustpilot
Legg til iMusic ønskeliste
eller

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.

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 29. juni 2010
ISBN13 9783838349060
Utgivere LAP Lambert Academic Publishing
Antall sider 116
Mål 225 × 7 × 150 mm   ·   191 g
Språk Tysk  

Se alt med Nahit Emanet ( f.eks. Pocketbok )