Complexity and approximability results for slicing floorplan designs
Article Abstract:
The optimization problems in fixing the orientations of the cells and the directions of the cuts for slicing floorplan design are determined. This process minimizes the area of the VLSI chip. These problems are NP-hard and a pseudo-polynomial time algorithm and fully polynomial time approximation schemes for these problems are presented.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
Computational complexity, Computational complexity (Machine theory)
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
A Benders decomposition approach for the robust spanning tree problem with interval data
Article Abstract:
A study examines the minimum spanning tree problem using a Benders decomposition. Combinatorial optimization is done in the study.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Switzerland, Analysis, Evaluation, Trees (Graph theory)
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Usage, Combinatorial optimization
Similar abstracts:
- Abstracts: Economic investment times for capacity expansion problems. Determination of minimum number of sensors and their locations for an automated facility: an algorithmic approach
- Abstracts: Identification of transshipment center locations. Early-tardy cost trade-offs in resource constrained projects with cash flows: an optimization-guided heuristic approach
- Abstracts: Locating and sizing road maintenance depots. Locating an obnoxious plane. Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.