An algorithm finding p-medians of a graph

DOI10.1007/BF01074721zbMath0607.90085MaRDI QIDQ3748084

S. A. Gorunovich

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Implicit representation of generalized variable upper bounds in linear programming
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

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