The continuousm-center problem on a network

DOI10.1002/NET.3230150205MaRDI QIDQ3703609zbMATH OpenOpenAlexFDO

Authors G. Handler, Margalit Rozman

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230150205

zbMATH Keywords

continuous m-center problem on a networkinfinite size covering problemslarge-scale networksrelaxation algorithmtransportation network

Mathematics Subject Classification ID

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

Recommendations

• A note on the m-center problem with rectilinear distances
• scientific article; zbMATH DE number 279289
• scientific article; zbMATH DE number 4059089
• scientific article; zbMATH DE number 125274
• Continuous center problems

Cites work

• Cutting planes from conditional bounds: A new approach to set covering
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

Cited in

(7)

• Group centre and group median of a network
• Facility location for large-scale emergencies
• \(k\)-center of network location problem based on improved algorithm
• A finite algorithm for the continuousp-center location problem on a graph
• On the Solution Value of the Continuous p-Center Location Problem on a Graph
• scientific article; zbMATH DE number 4059089 (Why is no real title available?)
• A note on the m-center problem with rectilinear distances

This page was built for publication: The continuousm-center problem on a network

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