The \(p\)-facility ordered median problem on networks

DOI10.1007/BF02578990zbMath1139.90395MaRDI QIDQ2568602

Justo Puerto, José A. Moreno Pérez, Dionisio Perez-Britos, Antonio M. Rodríguez-Chía

Publication date: 18 October 2005

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

finite dominating setsnetworkslocation

Mathematics Subject Classification ID

Continuous location (90B85) Deterministic network models in operations research (90B10)

Related Items (5)

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ Unreliable point facility location problems on networks ⋮ Multi-facility ordered median problems in directed networks ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic procedures for solving the discrete ordered median problem
• Algorithmic results for ordered median problems
• A flexible approach to location problems
• Exact procedures for solving the discrete ordered median problem
• Finite Dominating Sets for Network Location Problems
• Aggregation Error Bounds for a Class of Location Models
• Multifacility ordered median problems on networks: A further analysis
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: The \(p\)-facility ordered median problem on networks