Article citationsMore>>

M. Dell’ Amico, M. Iori, S. Martello and M. Monaci, “Lower Bound and Heuristic Algorithms for the ^k₁ partitioning Problem,” European Journal of Operational Research, Vol. 171, 2006, pp. 725-742. doi:10.1016/j.ejor.2004.09.002

has been cited by the following article:

• TITLE: Approximation Schemes for the 3-Partitioning Problems

  AUTHORS: Jianbo Li, Honglin Ding

  KEYWORDS: 3-partitioning Problem; Approximation Scheme

  JOURNAL NAME: Communications and Network, Vol.5 No.1B, November 7, 2013

  ABSTRACT: The 3-partitioning problem is to decide whether a given multiset of nonnegative integers can be partitioned into triples that all have the same sum. It is considerably used to prove the strong NP-hardness of many scheduling problems. In this paper, we consider four optimization versions of the 3-partitioning problem, and then present four polynomial time approximation schemes for these problems.