Using well-solvable quadratic assignment problems for VLSI interconnect applications (Q412356): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2011.11.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2012738295
@@ Property / OpenAlex ID: W2012738295 / rank @@
+Normal rank
@@ Property / cites work @@
+The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
+Normal rank
@@ Property / cites work @@
+Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
+Normal rank
@@ Property / cites work @@
+Four point conditions and exponential neighborhoods for symmetric TSP
+Normal rank
@@ Property / cites work @@
+Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
+Normal rank
@@ Property / cites work @@
+Optimal wire ordering and spacing in low power semiconductor design
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Extreme Hamiltonian lines
@@ Property / cites work: Extreme Hamiltonian lines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4459105
@@ Property / cites work: Q4459105 / rank @@
+Normal rank