Neighborhood Search
	Combinatorial Optimization:  minimize (f(S) : S Î F) u f is typically linear, u F is finite
		Neighborhood Function: u For each S Î F, there is a neighborhood N(S); u We say that S is a local optimum if f(S) £  f(T) for all T Î N(S);