The hypergraph assignment problem (Q2339846): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2014.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1985530626
@@ Property / OpenAlex ID: W1985530626 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hypergraph Model for Railway Vehicle Rotation Planning
+Normal rank
@@ Property / cites work @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Flows on hypergraphs
@@ Property / cites work: Flows on hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning
+Normal rank
@@ Property / cites work @@
+Hall's theorem for hypergraphs
@@ Property / cites work: Hall's theorem for hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Gainfree Leontief substitution flow problems
@@ Property / cites work: Gainfree Leontief substitution flow problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank