An efficient algorithm for the complete set partitioning problem
From MaRDI portal
Publication:1056674
DOI10.1016/0166-218X(83)90069-0zbMath0523.90062MaRDI QIDQ1056674
Harvey M. Salkin, Chien-Hua Mike Lin
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
computational results; enumerative algorithm; complete set partitioning problem; corporate tax payment
65K05: Numerical mathematical programming methods
90C90: Applications of mathematical programming
90C10: Integer programming
91B99: Mathematical economics
90C09: Boolean programming
Related Items
Cites Work