On cent-dians of general networks

DOI10.1016/S0966-8349(97)00009-0MaRDI QIDQ4228770zbMATH OpenOpenAlexWikidataFDO

Authors W. Ogryczak

Publication date 1 March 1999

Published in Location Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0966-8349(97)00009-0

zbMATH Keywords

bicriteria modelcentrelocation on networksmedianPareto-optimal compromise locationsPareto-optimality

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Recommendations

• The generalized \(p\)-centdian on network
• Generalized diameters and Rabin numbers of networks
• scientific article; zbMATH DE number 4133011
• The centdian subtree on tree networks
• On general resolutions due to networks
• The continuous center set of a network
• A Generalized Distance in Graphs and Centered Partitions
• scientific article; zbMATH DE number 4116588

Cited in

(9)

• Inequality measures and equitable approaches to location problems
• The probabilistic \(p\)-center problem: planning service for potential customers
• Fair optimization and networks: a survey
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation
• On the set of optimal solutions of Cent-Dian problems in continuous spaces
• scientific article; zbMATH DE number 1253064 (Why is no real title available?)
• The generalized \(p\)-centdian on network
• On -cent-dians and generalized-center for network design: definitions and properties
• A polynomial algorithm for the multicriteria cent-dian location problem

This page was built for publication: On cent-dians of general networks

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