Automated placement of analog integrated circuits using priority-based constructive heuristic

DOI10.1016/J.COR.2024.106643MaRDI QIDQ6568458zbMATH OpenFDO

Authors Josef Grus, Zdeněk Hanzálek

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationgenetic algorithmrectangle packinganalog circuit placement

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
• A random key based genetic algorithm for the resource constrained project scheduling problem
• Denser packings obtained in \(O(n \log \log n)\) time
• Extreme point-based heuristics for three-dimensional bin packing
• Optimal facility layout and material handling network design
• Optimal rectangle packing
• Reactive GRASP for the strip-packing problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• The longest processing time rule for identical parallel machines revisited

This page was built for publication: Automated placement of analog integrated circuits using priority-based constructive heuristic

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