Gaast, J.P. van der

cluster organization solution problem application search algorithm number neighborhood value allocation saascp result constraint tabu search heuristic heuristic iteration reduction research software capacity cluster j facility european journal symmetry location t l 1 model tabu search tabu search algorithm performance organization i instance neighborhood reduction strategy journal neighborhood reduction demand strategy solution value section ts algorithm t l 2 integer program ip model opening clusters opening capacitated european 1.3 cplex abest shift network fferent installation costs fication service fi nding series paper graph partitioning problem table parameter report tabu list fi rst 5.3 performance 2 hours graph order phase figure partitioning erasmu management quality column column “ nr experiment