The three-partition problem is one of the most famous strongly NP-complete
combinatorial problems. We introduce properties which, in many cases, can a
llow either a quick solution of an instance or a reduction of its size. The
average effectiveness of the properties proposed is tested through computa
tional experiments.