An improved lower bound for the multimedian location problem

被引：0
|
作者：
Nuggehalli, R [1 ]
Lowe, TJ
Ward, JE
机构：
[1] United Parcel Serv, Lutherville Timonium, MD 21093 USA
[2] Univ Iowa, Iowa City, IA 52242 USA
[3] Purdue Univ, W Lafayette, IN 47907 USA
来源：
ANNALS OF OPERATIONS RESEARCH | 2002年 / 110卷 / 1-4期
基金：
美国国家科学基金会;
关键词：
location on networks; median problem; lower bound;
D O I：
10.1023/A:1020755231275
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the problem of locating, on a network, n new facilities that interact with m existing facilities. In addition, pairs of new facilities interact. This problem, the multimedian location problem on a network, is known to be NP-hard. We give a new integer programming formulation of this problem, and show that its linear programming relaxation provides a lower bound that is superior to the bound provided by a previously published formulation. We also report results of computational testing with both formulations.
引用
收藏
页码：17 / 31
页数：15
相关论文
共 50 条
  • [21] AN IMPROVED BL LOWER BOUND
    BROWN, DJ
    [J]. INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 37 - 39
  • [22] Improved Lower Bound for A General Case of The Master-plate Design Problem
    Xie, Xie
    Li, Yanping
    Zheng, Yongyue
    [J]. PROCEEDING OF THE IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2012, : 856 - 860
  • [23] Improved exponential time lower bound of knapsack problem under BT model
    Li, Xin
    Liu, Tian
    Peng, Han
    Qian, Liyan
    Sun, Hongtao
    Xu, Jin
    Xu, Ke
    Zhu, Jiaqi
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 624 - +
  • [24] An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
    Cheng Lu
    Zhenbo Wang
    Wenxun Xing
    [J]. Journal of Global Optimization, 2010, 48 : 497 - 508
  • [25] An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
    Lu, Cheng
    Wang, Zhenbo
    Xing, Wenxun
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2010, 48 (03) : 497 - 508
  • [26] A LOWER BOUND FOR HEILBRONN PROBLEM
    KOMLOS, J
    PINTZ, J
    SZEMEREDI, E
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1982, 25 (FEB): : 13 - 24
  • [27] AN IMPROVED BOUND FOR THE MULTIFACILITY LOCATION MODEL
    ALLEN, WR
    [J]. OPERATIONS RESEARCH LETTERS, 1995, 17 (04) : 175 - 180
  • [28] An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over norm
    Chen, Wenbin
    Peng, Lingxi
    Wang, Jianxiong
    Li, Fufang
    Tang, Maobin
    Xiong, Wei
    Wang, Songtao
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (03) : 447 - 455
  • [29] The Piltz divisor problem in number fields:: An improved lower bound by Soundararajan's method
    Girstmair, K
    Kühleitner, M
    Müller, W
    Nowak, WG
    [J]. ACTA ARITHMETICA, 2005, 117 (02) : 187 - 206
  • [30] An improved lower bound for crossing numbers
    Djidjev, H
    Vrto, I
    [J]. GRAPH DRAWING, 2002, 2265 : 96 - 101
12345