Lower bounds and heuristic algorithms for the ki-partitioning problem

  • Dell'Amico M
  • Iori M
  • Martello S
 et al. 
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 7

    Citations

    Citations of this article.

Abstract

We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of values in a subset is minimized, and the number of values in each subset does not exceed the corresponding limit. The problem is related to scheduling and bin packing problems. We give combinatorial lower bounds, reduction criteria, constructive heuristics, a scatter search approach, and a lower bound based on column generation. The outcome of extensive computational experiments is presented. © 2004 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Bin packing
  • Cardinality constraints
  • Column generation
  • Parallel machines
  • Partitioning
  • Scatter search
  • Scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free