Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285): Difference between revisions

@@ Property / cites work @@
+A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
+Normal rank
@@ Property / cites work @@
+Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
+Normal rank
@@ Property / cites work @@
+Approximating Layout Problems on Random Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the vertex separation problem
+Normal rank
@@ Property / cites work @@
+Parallel variable neighbourhood search strategies for the cutwidth minimization problem
+Normal rank
@@ Property / cites work @@
+On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Cutwidth: obstructions and algorithmic aspects
@@ Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank @@
+Normal rank
@@ Property / cites work @@
+Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
+Normal rank
@@ Property / cites work @@
+Narrowness, pathwidth, and their application in natural language processing
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
+Normal rank
@@ Property / cites work @@
+On minimizing width in linear layouts
@@ Property / cites work: On minimizing width in linear layouts / rank @@
+Normal rank
@@ Property / cites work @@
+Topological Bandwidth
@@ Property / cites work: Topological Bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the matrix bandwidth minimization
+Normal rank
@@ Property / cites work @@
+Branch and bound for the cutwidth minimization problem
+Normal rank
@@ Property / cites work @@
+Min Cut is NP-complete for edge weighted trees
@@ Property / cites work: Min Cut is NP-complete for edge weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for the minimum cut linear arrangement problem
+Normal rank
@@ Property / cites work @@
+Scatter search for the cutwidth minimization problem
+Normal rank
@@ Property / cites work @@
+A hybrid method for the probabilistic maximal covering location-allocation problem
+Normal rank
@@ Property / cites work @@
+GRASP and path relinking for the matrix bandwidth minimization.
+Normal rank
@@ Property / cites work @@
+Antibandwidth and cyclic antibandwidth of meshes and hypercubes
+Normal rank
@@ Property / cites work @@
+Cutwidth of the de Bruijn graph
@@ Property / cites work: Cutwidth of the de Bruijn graph / rank @@
+Normal rank
@@ Property / cites work @@
+GRASP and path relinking for the max-min diversity problem
+Normal rank
@@ Property / cites work @@
+Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
+Normal rank
@@ Property / cites work @@
+An analysis of variance test for normality (complete samples)
+Normal rank
@@ Property / cites work @@
+PATHWIDTH AND LAYERED DRAWINGS OF TREES
@@ Property / cites work: PATHWIDTH AND LAYERED DRAWINGS OF TREES / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796189
@@ Property / cites work: Q4796189 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472491
@@ Property / cites work: Q4472491 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the min-cut linear arrangement of trees
+Normal rank