Confined location of facilities on a graph

DOI10.1080/02331939408843926zbMath0819.90051OpenAlexW2050490515MaRDI QIDQ3835644

No author found.

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityoptimality criterialocation problems on a graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Analytical models for locating undesirable facilities
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Confined location of facilities on a graph