On a pair of job-machine assignment problems with two stages (Q732901): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2009.05.009
@@ Property / DOI: 10.1016/j.cor.2009.05.009 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Selected topics on assignment problems
@@ Property / cites work: Selected topics on assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+An augmenting path method for solving linear bottleneck assignment problems
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Finding the upper envelope of n line segments in O(n log n) time
+Normal rank
@@ Property / cites work @@
+Balanced optimization problems
@@ Property / cites work: Balanced optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for the maximum capacity path problem
+Normal rank
@@ Property / cites work @@
+Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
+Normal rank
@@ Property / cites work @@
+Bilevel time minimizing assignment problem
@@ Property / cites work: Bilevel time minimizing assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+On some techniques useful for solution of transportation network problems
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2009.05.009
@@ Property / DOI: 10.1016/J.COR.2009.05.009 / rank @@
+Normal rank