Pastāsti draugiem par šo preci:
The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem Nahit Emanet
Pasūtīts no attālās noliktavas
Mūsu klienti saka:
The Rectilinear Steiner Tree Problem: Sequential and Parallel Algorithms for the Rectilinear Steiner Tree Problem
Nahit Emanet
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2010. gada 29. jūnijs |
| ISBN13 | 9783838349060 |
| Izdevēji | LAP Lambert Academic Publishing |
| Lapas | 116 |
| Izmēri | 225 × 7 × 150 mm · 191 g |
| Valoda | Vācu |
Skatīt visus Nahit Emanet ( piem., Paperback Book )