A discrete dynamic convexized method for VLSI circuit partitioning (Q2867400): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556788.2012.663372
+Normal rank
@@ Property / OpenAlex ID @@
+W2021939221
@@ Property / OpenAlex ID: W2021939221 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel multilevel algorithms for hypergraph partitioning
+Normal rank
@@ Property / cites work @@
+An effective multilevel tabu search approach for balanced graph partitioning
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+A combined evolutionary search and multilevel optimisation approach to graph-partitioning
+Normal rank
@@ Property / cites work @@
+Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
+Normal rank
@@ Property / cites work @@
+A discrete dynamic convexized method for nonlinear integer programming
+Normal rank