Skip to main content
SpringerLink
Log in

A dynamic programming approach to the complete set partitioning problem

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The complete set partitioning (CSP) problem is a special case of the set partitioning problem where the coefficient matrix has 2m−1 columns, each column being a binary representation of a unique integer between 1 and 2m−1,m⩾1. It has wide applications in the area of corporate tax structuring in operations research. In this paper we propose a dynamic programming approach to solve the CSP problem, which has time complexityO(3m), wheren=2m−1 is the size of the problem space.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).

  2. R. Garfinkel and G. Nemhauser,The set partitioning problem: Set covering problem with equality constraints, Operations Research 17, no. 5 (1969), pp. 848–856.

    Google Scholar 

  3. E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms, Computer Science Press (1978).

  4. C. H. Lin,Corporate Tax Structures and a Special Class of Set Partitioning Problems, Ph. D. Thesis, Department of Operation Research, Case Western Reserve University, Cleveland, OH (1976).

    Google Scholar 

  5. C. H. Lin and H. M. Salkin,Aggregation of subsidiary firms for minimal unemployment compensation payments via integer programming, Management Science 25, no. 4 (1979), pp. 405–408.

    Google Scholar 

  6. C. H. Lin and H. M. Salkin,An efficient algorithm for the complete set partitioning problem. Discrete Applied Mathematics 6 (1983), pp. 149–156.

    Google Scholar 

  7. C. L. Liu,Introduction to Combinational Mathematics, Computer Science Press (1971).

  8. J. Pierce,Application of combinatorial programming to a class of all zero-one integer programming problems, Management Science 15, no. 1 (1968), pp. 191–209.

    Google Scholar 

  9. H. M. Salkin, B. V. Dean, S. Morito, and C. H. Lin,On minimizing workman's compensation payments by linear programming, in H. Salkin and J. Saha, eds,Studies in Linear Programming, North-Holland (1975).

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Arizona State University, 85287, Tempe, Arizona, U.S.A.

    D. Yun Yeh

Authors
  1. D. Yun Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yun Yeh, D. A dynamic programming approach to the complete set partitioning problem. BIT 26, 467–474 (1986). https://doi.org/10.1007/BF01935053

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01935053

CR Categories

Keywords

Search

Navigation