Matchings in connection with ground delay program planning (Q5191150): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20272
@@ Property / full work available at URL: https://doi.org/10.1002/net.20272 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4230640736
@@ Property / OpenAlex ID: W4230640736 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4208001
@@ Property / cites work: Q4208001 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Transversals and matroid partition
@@ Property / cites work: Transversals and matroid partition / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching in a convex bipartite graph
@@ Property / cites work: Maximum matching in a convex bipartite graph / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities: theory of majorization and its applications
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for maximum matchings in convex, bipartite graphs
+Normal rank
@@ Property / cites work @@
+Optimization and mediated bartering models for ground delay programs
+Normal rank