\(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041): Difference between revisions

@@ Property / cites work @@
+The permutahedron of \(N\)-sparse posets
@@ Property / cites work: The permutahedron of \(N\)-sparse posets / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(p\)-connectedness of graphs---a survey
@@ Property / cites work: On the \(p\)-connectedness of graphs---a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501779
@@ Property / cites work: Q5501779 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval orders without odd crowns are defect optimal
+Normal rank
@@ Property / cites work @@
+<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
+Normal rank
@@ Property / cites work @@
+On a unique tree representation for \(P_ 4\)-extendible graphs
+Normal rank
@@ Property / cites work @@
+A tree representation for \(P_ 4\)-sparse graphs
@@ Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
+Normal rank