Solving the train marshalling problem by inclusion-exclusion (Q516904): Difference between revisions

@@ Property / cites work @@
+Inclusion and exclusion algorithm for the Hamiltonian path problem
+Normal rank
@@ Property / cites work @@
+Algorithms to count paths and cycles
@@ Property / cites work: Algorithms to count paths and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+A finite-difference sieve to count paths and cycles by length
+Normal rank
@@ Property / cites work @@
+Exact algorithms for exact satisfiability and number of perfect matchings
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+The train marshalling problem
@@ Property / cites work: The train marshalling problem / rank @@
+Normal rank
@@ Property / cites work @@
+Shunting for Dummies: An Introductory Algorithmic Survey
+Normal rank
@@ Property / cites work @@
+Multistage methods for freight train classification
+Normal rank
@@ Property / cites work @@
+Dynamic programming meets the principle of inclusion and exclusion
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3668280
@@ Property / cites work: Q3668280 / rank @@
+Normal rank