Keskin, B.B. and üster, H. (2007) A Scatter Search-Based Heuristic to Locate Capacitated Transhipment Points. Computers & Operations Research, 34, 3112- 3125.
http://dx.doi.org/10.1016/j.cor.2005.11.020

has been cited by the following article:

• TITLE: Application of Modified Benders Decomposition to Single-Stage Multi-Commodity Multi-Period Warehouse Location Problem: An Empirical Investigation

  AUTHORS: Renduchintala Raghavendra Kumar Sharma, Ankita Malviya, Vimal Kumar, Vinay Singh, Pritee Agarwal

  KEYWORDS: Benders Decomposition, SSMCMPWLP, Strong and Weak Formulation, Warehouse Location, Distribution

  JOURNAL NAME: American Journal of Operations Research, Vol.6 No.3, May 31, 2016

  ABSTRACT: In the past, researchers have applied Bender’s decomposition to distribution problem and used feasibility constraint to speed up the performance of Bender’s decomposition. Further, the application of Branch and Bound to single-stage multi-commodity single-period warehouse location problem (SSMCSPWLP) with strong constraints has shown that they are more effective. It was also shown in the previous research (in the context of Branch and Bound Methodology) that hybrid formulation for the single-stage single-period multi-commodity warehouse location problem yielded superior results. In this paper we apply Benders’ decomposition to strong and weak formulations of single-stage multi-commodity multi-period warehouse location problem (SSMCMPWLP). As suggested in the previous literature we put feasibility constraints in the pure integer sub- problem to speed up the performance of Benders’ decomposition. We also develop an additional cut (constraint that is again added to pure integer sub-problem) and show that it further speeded up Benders’ Decomposition. This research led to the possibility of applying Benders’ Decomposition to the hybrid formulation of SSMCMPWLP in future.