A Class of Balanced Matrices Arising from Location Problems
From MaRDI portal
Recommendations
Cites work
- A characterisation of rigid circuit graphs
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Balanced matrices
- Blocking and anti-blocking pairs of polyhedra
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- Normal hypergraphs and the perfect graph conjecture
- Perfect zero–one matrices
- Polynomially bounded algorithms for locatingp-centers on a tree
Cited in
(20)- Totally balanced and totally unimodular matrices defined by center location problems
- On locating new facilities in a competitive environment
- Locational analysis
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- NeST graphs
- Location routing problems on trees
- Neighborhood subtree tolerance graphs
- Optimisation and hypergraph theory
- Reliability, covering and balanced matrices
- Balanced matrices
- Two classes of location problems on tree networks
- Totally-Balanced and Greedy Matrices
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- MATRIX BALANCING PROBLEM AND BINARY AHP(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Perfect, ideal and balanced matrices
- Recognition of linear and star variants of leaf powers is in P
- Competitive location in the plane
- Balanced Cayley graphs and balanced planar graphs
- Rooted directed path graphs are leaf powers
- Exact leaf powers
This page was built for publication: A Class of Balanced Matrices Arising from Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222208)
