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 / &

共 6 条

[1] AN EXPERIMENTAL INVESTIGATION AND COMPARATIVE EVALUATION OF FLOW-SHOP SCHEDULING TECHNIQUES [J].