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

DOI10.1007/BF01082609MaRDI QIDQ3812004zbMATH OpenOpenAlexFDO

Authors 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

branch-and-boundbranching heuristicsfacility location on networksgraphlocation problemoptimal groupingradial componentssystem of service centers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4051314
• Capacitated, balanced, sequential location-allocation problems on chains and trees
• Solving a bicriteria problem of optimal service centers location
• Dynamic Location-routeing Problems
• Best location of service centers in a treelike network under budget constraints

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812004)