Minimizing the maximum bump cost in linear extensions of a poset (Q385489): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9456-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1991199948
@@ Property / OpenAlex ID: W1991199948 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Setups for Cycle-Free Ordered Sets
@@ Property / cites work: Minimizing Setups for Cycle-Free Ordered Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing bumps in linear extensions of ordered sets
+Normal rank
@@ Property / cites work @@
+On minimizing the jump number for interval orders
@@ Property / cites work: On minimizing the jump number for interval orders / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the bump number is easy
@@ Property / cites work: Computing the bump number is easy / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the sum cost in linear extensions of a poset
+Normal rank
@@ Property / cites work @@
+Computing the bump number with techniques from two-processor scheduling
+Normal rank
@@ Property / cites work @@
+Minimizing the jump number for partially ordered sets: A graph-theoretic approach
+Normal rank
@@ Property / cites work @@
+A polynomially solvable case of optimal linear extension problem of a poset
+Normal rank