Adjacency on the constrained assignment problem (Q1270787): Difference between revisions

@@ Property / cites work @@
+A remark on the faces of the cone of Euclidean distance matrices
+Normal rank
@@ Property / cites work @@
+On the Assignment Polytope
@@ Property / cites work: On the Assignment Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in linear programming
@@ Property / cites work: Some NP-complete problems in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3858023
@@ Property / cites work: Q3858023 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching of given weight in complete and complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+Adjacency on Convex Polyhedra
@@ Property / cites work: Adjacency on Convex Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+The adjacency relation on the traveling salesman polytope is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank