article

Heuristics for the fixed cost median problem

Author:

Dorit S. HochbaumAuthors Info & Claims

Mathematical Programming: Series A and B, Volume 22, Issue 1

Pages 148 - 162

https://doi.org/10.1007/BF01581035

Published: 01 December 1982 Publication History

Abstract

We describe in this paper polynomial heuristics for three important hard problems--the discrete fixed cost median problem (the plant location problem), the continuous fixed cost median problem in a Euclidean space, and the network fixed cost median problem with convex costs. The heuristics for all the three problems guarantee error ratios no worse than the logarithm of the number of customer points. The derivation of the heuristics is based on the presentation of all types of median problems discussed as a set covering problem.

References

[1]

V. Chvátal, "A greedy heuristic for the set-covering problem", Mathematics of Operations Research 4 (3) (1979) 233-235.

Digital Library

Google Scholar

[2]

G. Cornuejols, M.L. Fisher and G. Nemhauser, "Location of bank accounts to optimize float", Management Science 23 (8) (1977) 789-810.

Digital Library

Google Scholar

[3]

S.L. Hakimi, "Optimum distribution of switching centers in a communication network and some related graph theoretic problems", Operations Research 13 (1965) 462-475.

Digital Library

Google Scholar

[4]

D.S. Johnson, "Approximation algorithms for combinatorial problems", Journal of Computer and Systems Sciences 9 (1974) 256-278.

Digital Library

Google Scholar

[5]

U.G. Knight, Power systems engineering and mathematics (Pergamon Press, London 1972).

Google Scholar

[6]

L. Lovász, "On the ratio of optimal integral and fractional covers", Discrete Mathematics 13 (1975) 383-390.

Digital Library

Google Scholar

[7]

"1970 National Power Survey", Part 1, Prepared by the Federal Power Commission, U.S. Government Printing Office.

Google Scholar

Cited By

View all

Etesami SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access CostsProceedings of the ACM Web Conference 202410.1145/3589334.3645654(4340-4351)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645654
Zhang RAgmon NAn BRicci AYeoh W(2023)Mechanism Design for Heterogeneous and Distributed Facility Location ProblemsProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3599146(2985-2987)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.5555/3545946.3599146
Chen XLiu WNong QFang Q(2022)Bounding quality of pure Nash equilibria in dual-role facility location gamesJournal of Combinatorial Optimization10.1007/s10878-022-00905-744:5(3520-3534)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s10878-022-00905-7
Show More Cited By

Heuristics for the fixed cost median problem
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies

Recommendations

GRASP for the uncapacitated r-allocation p-hub median problem

In this paper we propose a heuristic for the Uncapacitated r-Allocation p-Hub Median Problem. In the classical p-hub location problem, given a set of nodes with pairwise traffic demands, we must select p of them as hub locations and route all traffics ...
A Bionomic Approach to the Capacitated p-Median Problem

This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good ...
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters

We show that in an optimal solution of the economic lot-sizing problem the total holding cost in an order interval is bounded from above by a quantity proportional to the setup cost and the logarithm of the number of periods in the interval. We present ...

Comments

Information & Contributors

Information

Published In

cover image Mathematical Programming: Series A and B

Mathematical Programming: Series A and B Volume 22, Issue 1

December 1982

356 pages

ISSN:0025-5610

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 December 1982

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

69
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Etesami SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access CostsProceedings of the ACM Web Conference 202410.1145/3589334.3645654(4340-4351)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645654
Zhang RAgmon NAn BRicci AYeoh W(2023)Mechanism Design for Heterogeneous and Distributed Facility Location ProblemsProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3599146(2985-2987)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.5555/3545946.3599146
Chen XLiu WNong QFang Q(2022)Bounding quality of pure Nash equilibria in dual-role facility location gamesJournal of Combinatorial Optimization10.1007/s10878-022-00905-744:5(3520-3534)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s10878-022-00905-7
Harks THoefer MSchedel ASurek M(2021)Efficient Black-Box Reductions for Separable Cost SharingMathematics of Operations Research10.1287/moor.2020.105046:1(134-158)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1287/moor.2020.1050
Lv WWu C(2021)An LP-rounding based algorithm for a capacitated uniform facility location problem with penaltiesJournal of Combinatorial Optimization10.1007/s10878-021-00726-041:4(888-904)Online publication date: 1-May-2021
https://dl.acm.org/doi/10.1007/s10878-021-00726-0
Han LXu DXu YZhang D(2020)Approximating the -relaxed soft capacitated facility location problemJournal of Combinatorial Optimization10.1007/s10878-020-00631-y40:3(848-860)Online publication date: 1-Oct-2020
https://dl.acm.org/doi/10.1007/s10878-020-00631-y
Ren XLondon PZiani JWierman ALondon PZiani JWierman ARen X(2018)DatumIEEE/ACM Transactions on Networking10.1109/TNET.2018.281137426:2(893-905)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2811374
Fernandes CSchouery R(2018)Approximation Algorithms for the Max-Buying Problem with Limited SupplyAlgorithmica10.1007/s00453-017-0364-780:11(2973-2992)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00453-017-0364-7
Luo WSu BXu YLin G(2018)An Approximation Framework for Bounded Facility Location ProblemsComputing and Combinatorics10.1007/978-3-319-94776-1_30(353-364)Online publication date: 2-Jul-2018
https://dl.acm.org/doi/10.1007/978-3-319-94776-1_30
Ortiz-Astorquiza CContreras ILaporte G(2017)Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility LocationINFORMS Journal on Computing10.1287/ijoc.2017.075729:4(767-779)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1287/ijoc.2017.0757
Show More Cited By

Abstract

References

Cited By

Recommendations

GRASP for the uncapacitated r-allocation p-hub median problem

A Bionomic Approach to the Capacitated p-Median Problem

A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations