This paper gives a brief survey of Tabu search methodology - one of the widely used modem general heuristics, originally designed to solve combinatorial optimization problems. The power of this methodology is illustrated by applications to two different types of real-life large dimensional problems: a combinatorial assigngnment problem and a continuous optimal design problem.