The counting complexity of a simple scheduling problem (Q1038110): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2009.05.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2032776320
@@ Property / OpenAlex ID: W2032776320 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Counting and enumeration complexity with application to multicriteria scheduling
+Normal rank
@@ Property / cites work @@
+Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank