performance of algorithms for initial placement
This paper analyzes the performance of a commonly used class of methods for initial placement and describes several new classes. The classification in this paper is based on common methods of problem-solving used in artificial intelligence (AI) approaches. The paper does not describe the details of algorithms; instead it focuses on the qualitative performance.
performance algorithm placement paper class method classification intelligence branch-and-bound means-ends analysis lower and upper bounds irrevocable and tentative search forward and backward reasoning solution space virtual placement