Refinements on an enumeration scheme for solving a pattern sequencing problem (Q3158869): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2004.00458.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2026641910
@@ Property / OpenAlex ID: W2026641910 / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation and search number of a graph
+Normal rank
@@ Property / cites work @@
+Heuristic and exact methods for the cutting sequencing problem
+Normal rank
@@ Property / cites work @@
+Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Connections between cutting-pattern sequencing, VLSI design, and flexible machines
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+On a pattern sequencing problem to minimize the maximum number of open stacks
+Normal rank
@@ Property / cites work @@
+Heuristics for sequencing cutting patterns
@@ Property / cites work: Heuristics for sequencing cutting patterns / rank @@
+Normal rank