An efficient algorithm for the complete set partitioning problem

DOI10.1016/0166-218X(83)90069-0zbMath0523.90062OpenAlexW2046232668MaRDI QIDQ1056674

Harvey M. Salkin, Chien-Hua Mike Lin

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90069-0

zbMATH Keywords

computational resultsenumerative algorithmcomplete set partitioning problemcorporate tax payment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Mathematical economics (91B99) Boolean programming (90C09)

Related Items (2)

A dynamic programming approach to the complete set partitioning problem ⋮ A hybrid exact algorithm for complete set partitioning

Cites Work

• Unnamed Item
• The Set-Partitioning Problem: Set Covering with Equality Constraints

This page was built for publication: An efficient algorithm for the complete set partitioning problem