M. Held and R. M. Karp, “The Travelling Salesman Prob lem and Minimum Spanning Trees,” Operations Re search, Vol. 18, No. 6, 1970, pp. 1138-1162. doi:10.1287/opre.18.6.1138
has been cited by the following article:
TITLE: Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution
AUTHORS: Eiman Jadaan Alenezy, Rehab F. Khalaf
KEYWORDS: Capacitated Facility Location Problem; Lagrangean Relaxation Technique; Volume Algorithm;Randomised Rounding Technique; Unit Cost Technique
JOURNAL NAME: Applied Mathematics, Vol.4 No.8, July 30, 2013
ABSTRACT: In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley.