Optimal wire ordering and spacing in low power semiconductor design

DOI10.1007/s10107-008-0231-zzbMath1184.90139OpenAlexW1997321617MaRDI QIDQ847831

Michael Ritter, Paul Zuber, Peter Gritzmann

Publication date: 19 February 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://mediatum.ub.tum.de/doc/1366082/document.pdf

zbMATH Keywords

Hamilton path

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Using well-solvable quadratic assignment problems for VLSI interconnect applications

Cites Work

• Unnamed Item
• Extreme Hamiltonian lines
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Special cases of travelling salesman problems and heuristics
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Integer Programming and Combinatorial Optimization

This page was built for publication: Optimal wire ordering and spacing in low power semiconductor design