The 1-Center Problem: Exploiting Block Structure

DOI10.1287/TRSC.22.4.259zbMath0665.90026OpenAlexW1965145846MaRDI QIDQ3818093

No author found.

Publication date: 1988

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.22.4.259

zbMATH Keywords

treeblock of a graphmaximal nonseparable subgraphblocking graphnonlinear 1-center problem on graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05)

Related Items (5)

Efficient algorithms for center problems in cactus networks ⋮ The backup 2-median problem on block graphs ⋮ A minimum length covering subgraph of a network ⋮ Locating an absolute center on graphs that are almost trees ⋮ Discrete Center Problems

This page was built for publication: The 1-Center Problem: Exploiting Block Structure