Balanced location on a graph

DOI10.1080/02331939508844156zbMath0874.90114OpenAlexW2022617046MaRDI QIDQ4351195

No author found.

Publication date: 27 August 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844156

zbMATH Keywords

NP-completenesspolynomial algorithmlocation on a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (6)

Unnamed Item ⋮ Biobjective center – balance graph location model^* ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ The reverse selective balance center location problem on trees ⋮ Unnamed Item ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients

Cites Work

• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An algorithm for the minimum variance point of a network
• The Problem of Compatible Representatives
• Unnamed Item

This page was built for publication: Balanced location on a graph