A note on the online interval scheduling secretary problem (Q2670476): Difference between revisions

@@ Property / cites work @@
+A Knapsack Secretary Problem with Applications
@@ Property / cites work: A Knapsack Secretary Problem with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934624
@@ Property / cites work: Q2934624 / rank @@
+Normal rank
@@ Property / cites work @@
+The dial-a-ride problem (DARP): variants, modeling issues and algorithms
+Normal rank
@@ Property / cites work @@
+Q5365115
@@ Property / cites work: Q5365115 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
+Normal rank
@@ Property / cites work @@
+Q2921721
@@ Property / cites work: Q2921721 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Secretary Problems on Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q5875570
@@ Property / cites work: Q5875570 / rank @@
+Normal rank