THE RECTILINEAR STEINER TREE PROBLEM: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE RECTILINEAR STEINER TREE PROBLEM - Nahit Emanet
-30% with code BOOKS
Shipping in 15-21 days
30-day return policy
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 ... Full description
You May Also Like
Description
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.
More Information
| Author | Nahit Emanet |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2010 |
| Cover type | Softcover |
| EAN | 9783838349060 |