Dell’Amico, Mauro; Martello, Silvano Reduction of the three-partition problem. (English) Zbl 0954.90038 J. Comb. Optim. 3, No. 1, 17-30 (1999). 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. Cited in 2 Documents MSC: 90C27 Combinatorial optimization Keywords:three-partition problem; reduction; combinatorial properties; combinatorial optimization; efficient implementation PDFBibTeX XMLCite \textit{M. Dell'Amico} and \textit{S. Martello}, J. Comb. Optim. 3, No. 1, 17--30 (1999; Zbl 0954.90038) Full Text: DOI