Partitioning technique for transforming perfect binary trees into single-row networks

DOI10.1007/S13160-012-0071-3zbMath1262.90147OpenAlexW2145117172MaRDI QIDQ691994

Ser Lee Loh, Shaharuddin Salleh

Publication date: 4 December 2012

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-012-0071-3

zbMATH Keywords

perfect binary treesingle-row routingtransformation and spine

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Optimization by Simulated Annealing
• Enhanced simulated annealing technique for the single-row routing problem
• Single-row transformation of complete graphs
• The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case
• On optimum single-row routing

This page was built for publication: Partitioning technique for transforming perfect binary trees into single-row networks