Group centre and group median of a network
From MaRDI portal
Publication:1123113
DOI10.1016/0377-2217(89)90473-6zbMath0676.90020OpenAlexW2043569906MaRDI QIDQ1123113
S. K. Gupta, Abraham P. Punnen
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90473-6
medianlocationassignmentcomputational analysisabsolute centregroup centregroup medianpolynomially bounded algorithms
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items (5)
The max-sum inverse median location problem on trees with budget constraint ⋮ Traveling salesman problem under categorization ⋮ Minimum perfect bipartite matchings and spanning trees under categorization ⋮ Inverse group 1-median problem on trees ⋮ Group centre and group median of a tree
Cites Work
- Unnamed Item
- Unnamed Item
- The absolute centre of a graph
- Bottleneck assignment problems under categorization
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- The continuousm-center problem on a network
- The optimal location of a path or tree in a tree network
- Centers to centroids in graphs
- On Locating a Facility to Service Areas within a Network
- Some Generalisations of the Time Minimising Assignment Problem
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- The Centers and Medians of a Graph
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Group centre and group median of a network