An algorithm finding p-medians of a graph

DOI10.1007/BF01074721MaRDI QIDQ3748084zbMATH OpenFDO

Authors S. A. Gorunovich

Publication date 1985

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

connected-integer polyhedrainteger simplex methodlarge-dimensional problemsp- median of a graphquasi-integer

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Linear programming (90C05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2043370
• scientific article; zbMATH DE number 3915986
• scientific article; zbMATH DE number 1416475
• An approximation algorithm for the \(p\)-hub median problem
• Computing median and antimedian sets in median graphs
• The median procedure on median graphs
• A computational study for the p-median problem
• An algorithm for finding a k-median in a directed tree
• scientific article; zbMATH DE number 4209907

Cites work

• scientific article; zbMATH DE number 3726086 (Why is no real title available?)
• Implicit representation of generalized variable upper bounds in linear programming
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Cited in

(2)

• scientific article; zbMATH DE number 1416475 (Why is no real title available?)
• Recognizing pseudo-median graphs

This page was built for publication: An algorithm finding p-medians of a graph

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