The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem - Nahit Emanet - Böcker - LAP Lambert Academic Publishing - 9783838349060 - 29 juni 2010
Om omslag och titel inte matchar är det titeln som gäller

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

Pris
SEK 469

Beställningsvara

Förväntad leverans 25 jun - 3 jul

Våra kunder säger:

14 dagars returrätt
Toppbetyg på Trustpilot
Lägg till din iMusic-önskelista
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öcker     Pocketbok   (Bok med mjukt omslag och limmad rygg)
Releasedatum 29 juni 2010
ISBN13 9783838349060
Utgivare LAP Lambert Academic Publishing
Antal sidor 116
Mått 225 × 7 × 150 mm   ·   191 g
Språk Tyska  

Se alt med Nahit Emanet ( t.ex. Pocketbok )