An efficient algorithm for the complete set partitioning problem
type: Item
instance of: scholarly article
title: An efficient algorithm for the complete set partitioning problem
zbMATH Open document ID: 0523.90062
DOI: 10.1016/0166-218X(83)90069-0
author: Harvey M. Salkin
author: Chien-Hua Mike Lin
published in: Discrete Applied Mathematics
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 91B99
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3829630
zbMATH Keywords: complete set partitioning problem
zbMATH Keywords: enumerative algorithm
zbMATH Keywords: computational results
zbMATH Keywords: corporate tax payment
MaRDI profile type: Publication
cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints
cites work: Q4082544
full work available at URL: 0166-218x(83)90069-0
OpenAlex ID: W2046232668
description: scientific article; zbMATH DE number 3829630