A Class of Balanced Matrices Arising from Location Problems
- 1 September 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 4 (3) , 363-370
- https://doi.org/10.1137/0604036
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Polynomially bounded algorithms for locatingp-centers on a treeMathematical Programming, 1982
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location ProblemsSIAM Journal on Computing, 1981
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Perfect zero–one matricesMathematical Programming, 1974
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- On balanced matricesPublished by Springer Nature ,1974
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Balanced matricesMathematical Programming, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971