BRANCH-AND-BOUND ALGORITHM FOR SEEKING P-MEDIAN

被引：48

作者：

JARVINEN, P

SINERVO, H

RAJALA, J

机构：

来源：

OPERATIONS RESEARCH | 1972年 / 20卷 / 01期

关键词：

D O I：

10.1287/opre.20.1.173

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

An algorithm is constructed and comparisons are made with the vertex- substitution method of M. B. Teitz and P. Bart. It is shown how the vertex- substitution method can lead to a local optimum, and give a heuristic method for finding a good initial solution for this method.

引用

页码：173 / &

共 50 条

[41] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
A. N. Maksimenko
Automatic Control and Computer Sciences, 2021, 55 : 816 - 826
[42] The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm
Maksimenko, A. N.
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2021, 55 (07) : 816 - 826
[43] A branch-and-cut method for the obnoxious p-median problem
Pietro Belotti
Martine Labbé
Francesco Maffioli
Malick M. Ndiaye
4OR, 2007, 5 : 299 - 314
[44] Towards a heterogeneous and adaptive parallel Branch-and-Bound algorithm
Chakroun, I.
Melab, N.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (01) : 72 - 84
[45] Fuzzy branch-and-bound algorithm for flow shop scheduling
İzzettİn Temİz
Serpİl Erol
Journal of Intelligent Manufacturing, 2004, 15 : 449 - 454
[46] An improved branch-and-bound algorithm for the test cover problem
Fahle, T
Tiemann, K
EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 89 - 100
[47] A MULTICRITERIA SCHEDULING TOOL USING A BRANCH-AND-BOUND ALGORITHM
BAUSCH, R
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 61 (1-2) : 215 - 218
[48] A reduced dimension branch-and-bound algorithm for molecular design
Ostrovsky, GM
Achenie, LEK
Sinha, M
COMPUTERS & CHEMICAL ENGINEERING, 2003, 27 (04) : 551 - 567
[49] A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda
Benson, Harold P.
Erenguc, Selcuk
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (13) : 3943 - 3961
[50] A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 298 (01) : 89 - 98

← 1 2 3 4 5 →