DYNAMIC PROGRAMMING APPROACH TO THE COMPLETE SET PARTITIONING PROBLEM.

被引：0
|
作者：
Yeh, D.Yun [1 ]
机构：
[1] Arizona State Univ, Tempe, AZ, USA, Arizona State Univ, Tempe, AZ, USA
来源：
BIT (Copenhagen) | 1986年 / 26卷 / 04期
关键词：
MATHEMATICAL TECHNIQUES - Set Theory;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The complete set partitioning (CSP) problem is a special case of the set partitioning problem where the coefficient matrix has 2**m minus 1 columns, each column being a binary representation of a unique integer between 1 and 2**m minus 1, m greater than equivalent to 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 complexity O(3**m), where n equals 2**m minus 1 is the size of the problem space.
引用
收藏
页码：467 / 474
相关论文
共 50 条
12345