M.G.C. Resende and R.F. Werneck
Submitted to ALENEX 2003, 2002
We present a new implementation of a widely used swap-based local search procedure for the p-median problem. It produces the same output as the best implementation described in the literature and has the same worst-case complexity, but, by using extra memory, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed.
PDF file of full paper
Mauricio G.C. Resende's Home PageLast modified: 19 September 2002