Multiterminal net assignments by scatter search

DOI10.1016/J.MCM.2004.03.006MaRDI QIDQ814239zbMATH OpenOpenAlexFDO

Authors Ming Gu, Fei He, Xiaoyu Song, Jiaguang Sun

Publication date 6 February 2006

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2004.03.006

zbMATH Keywords

FPGAheuristic methodsBoard-level routing problemScatter search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Scatter search for network design problem
• Mixed network design using hybrid scatter search
• A scatter search heuristic for the fixed-charge capacitated network design problem
• Efficient multiple-way network-partitioning algorithm
• Multiterminal global routing: A deterministic approximation scheme
• Multicast decentralized optimization algorithm for network resource allocation problems
• A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
• Routing multiterminal nets on a hexagonal grid
• Scatter Search and Path Relinking: Advances and Applications
• scientific article; zbMATH DE number 140462

Cites work

• scientific article; zbMATH DE number 107990 (Why is no real title available?)
• scientific article; zbMATH DE number 2159388 (Why is no real title available?)
• scientific article; zbMATH DE number 2209655 (Why is no real title available?)
• A model for designing callable bonds and its solution using tabu search
• A scatter-search-based learning algorithm for neural network training
• Probabilistic diversification and intensification in local search for vehicle routing

Describes a project that uses

Uses Software

• Scatter Search

This page was built for publication: Multiterminal net assignments by scatter search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814239)