Dynamic location problems with radial structure of the components of the connecting graph

DOI10.1007/BF01082609zbMath0661.90026OpenAlexW2045741265MaRDI QIDQ3812004

A. B. Boronin, O. Yu. Pershin

Publication date: 1988

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01082609

zbMATH Keywords

graphlocation problembranch-and-boundoptimal groupingbranching heuristicsfacility location on networksradial componentssystem of service centers

Mathematics Subject Classification ID

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

Cites Work

• Location-Allocation Problems
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: Dynamic location problems with radial structure of the components of the connecting graph