A sequential aggregation algorithm for the set partitioning problem (Q1819547)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A sequential aggregation algorithm for the set partitioning problem
scientific article

    Statements

    A sequential aggregation algorithm for the set partitioning problem (English)
    0 references
    1987
    0 references
    For the partitioning of large 0-1 integer sets, an algorithm is presented to compute in sequence a set of matrices where the different partitioned sets form the rows from which the optimum set is easily selected. The number of iterations equals the number of constraints and the technique yields fast and straightforward convergence of the solution. Practicality of the proposed algorithm is demonstrated through the optimum balancing of an assembly line.
    0 references
    convergence
    0 references
    zero-one integer program
    0 references
    cost minimum set partitioning problem
    0 references
    gradient search algorithm
    0 references
    0 references

    Identifiers