Optimal module sizing in VLSI floorplanning by nonlinear programming

DOI10.1007/BF01415168zbMath0667.90100OpenAlexW1974763131MaRDI QIDQ3820400

No author found.

Publication date: 1989

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415168

zbMATH Keywords

heuristicsVLSI designconvex nonlinear programmingFloorplanningprovably optimal shaperelative position graph

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Production models (90B30)

Related Items (6)

StreamTable: an area proportional visualization for tables with flowing streams ⋮ On duality for a class of quasiconcave multiplicative programs ⋮ An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming ⋮ Computing cartograms with optimal complexity ⋮ A nonlinear optimization methodology for VLSI fixed-outline floorplanning ⋮ A tutorial on geometric programming

Uses Software

• NAG
• nag

Cites Work

• On solving a primal geometric program by partial dual optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal module sizing in VLSI floorplanning by nonlinear programming