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 条

[1] An Improved Lower Bound for the Multimedian Location Problem
Ranganath Nuggehalli
Timothy J. Lowe
James E. Ward
[J]. Annals of Operations Research, 2002, 110 : 17 - 31
[2] THE MULTIMEDIAN LOCATION PROBLEM ON A NETWORK EXPLOITING BLOCK STRUCTURE
XU, Y
FRANCIS, RL
LOWE, TJ
[J]. TRANSPORTATION SCIENCE, 1994, 28 (02) : 116 - 124
[3] Improved lower bound for differentially private facility location
Manurangsi, Pasin
[J]. INFORMATION PROCESSING LETTERS, 2025, 187
[4] An improved lower bound for the changeover scheduling problem
Blocher, JD
Chand, S
[J]. IIE TRANSACTIONS, 1996, 28 (11) : 901 - 909
[5] AN IMPROVED LOWER BOUND FOR MULTIDIMENSIONAL DIMER PROBLEM
HAMMERSLEY, JM
[J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1968, 64 : 455 - +
[6] An improved lower bound for the bin packing problem
Chen, BT
Srivastava, B
[J]. DISCRETE APPLIED MATHEMATICS, 1996, 66 (01) : 81 - 94
[7] AN O(NM) ALGORITHM FOR A SPECIAL CASE OF THE MULTIMEDIAN LOCATION PROBLEM ON A TREE
CHHAJED, D
LOWE, TJ
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 63 (02) : 222 - 230
[8] Heuristic and lower bound for a stochastic location-routing problem
Albareda-Sambola, Maria
Fernandez, Elena
Laporte, Gilbert
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) : 940 - 955
[9] AN IMPROVED LOWER BOUND TO THE MINIMUM FLEET SIZE PROBLEM
STERN, HI
CEDER, A
[J]. TRANSPORTATION SCIENCE, 1983, 17 (04) : 471 - 477
[10] An improved branch & bound method for the Uncapacitated Competitive Location Problem
Benati, S
[J]. ANNALS OF OPERATIONS RESEARCH, 2003, 122 (1-4) : 43 - 58

← 1 2 3 4 5 →