×

Reduction of the three-partition problem. (English) Zbl 0954.90038

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

MSC:

90C27 Combinatorial optimization
PDFBibTeX XMLCite
Full Text: DOI