An efficient algorithm for the complete set partitioning problem
暂无分享,去创建一个
Abstract The complete set partitioning problem is the well known set partitioning problem with all possible nonzero binary columns in the constraint matrix. A highly specialized enumerative algorithm, which never requires the explicit maintenance of the constraint matrix, is presented. Computational results, with data reflecting a particular corporate tax payment scenario that can be modelled as a complete set partitioning problem, is also given.
[1] Harvey M. Salkin,et al. Integer Programming , 2019, Engineering Optimization Theory and Practice.
[2] J. F. Pierce. Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .
[3] H. Salkin,et al. Note---Aggregations of Subsidiary Firms for Minimal Unemployment Compensation Payments Via Integer Programming , 1979 .
[4] George L. Nemhauser,et al. The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..