A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
type: Item
instance of: scholarly article
title: A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
zbMATH Open document ID: 1382.68015
author: Yuzhen Niu
author: Xing Huang
author: Geng-Geng Liu
author: Wenzhong Guo
author: Guolong Chen
published in: Soft Computing
publication date: 2018-03-26T00:00:00Z
Mathematics Subject Classification ID: 68M07
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6852779
zbMATH Keywords: very large scale integration (VLSI)
zbMATH Keywords: performance-driven routing
zbMATH Keywords: octilinear Steiner tree (OST)
zbMATH Keywords: particle swarm optimization (PSO)
zbMATH Keywords: timing delay
zbMATH Keywords: number of bends
describes a project that uses: OR-Library
describes a project that uses: SPEA2
MaRDI profile type: Publication
full work available at URL: s00500-014-1329-2
OpenAlex ID: W1982719471
cites work: Q3948568
cites work: Q4424276
cites work: Q4667334
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: A survey on multi-net global routing for integrated circuits
cites work: Q4945796
DOI: 10.1007/S00500-014-1329-2
Recommended article: Q3520140
Recommended article: Q4694752
Recommended article: Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
Recommended article: Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
Recommended article: Preprocessing Steiner problems from VLSI layout
Recommended article: Q3210200
Recommended article: The Steiner tree packing problem in VLSI design
Recommended article: Efficient optimization by modifying the objective function: applications to timing-driven VLSI layout
description: scientific article; zbMATH DE number 6852779