A Class of Balanced Matrices Arising from Location Problems (Q3222208): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1137/0604036
@@ Property / full work available at URL: https://doi.org/10.1137/0604036 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2050038504
@@ Property / OpenAlex ID: W2050038504 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced matrices
@@ Property / cites work: Balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomially bounded algorithms for locatingp-centers on a tree
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133404
@@ Property / cites work: Q4133404 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank
@@ Property / cites work @@
+Perfect zero–one matrices
@@ Property / cites work: Perfect zero–one matrices / rank @@
+Normal rank