A discrete dynamic convexized method for VLSI circuit partitioning

DOI10.1080/10556788.2012.663372zbMath1283.90026OpenAlexW2021939221MaRDI QIDQ2867400

Jiarui Chen, Wen-Xing Zhu

Publication date: 19 December 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.663372

zbMATH Keywords

hypergraphdynamic convexized methodcircuit partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (2)

Graph partitioning: an updated survey ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method

Uses Software

• MLPart

Cites Work

• Unnamed Item
• Parallel multilevel algorithms for hypergraph partitioning
• An effective multilevel tabu search approach for balanced graph partitioning
• A discrete dynamic convexized method for nonlinear integer programming
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs

This page was built for publication: A discrete dynamic convexized method for VLSI circuit partitioning