A dynamic programming approach to the complete set partitioning problem

DOI10.1007/BF01935053zbMath0622.68047OpenAlexW2015062753MaRDI QIDQ1091142

D. Yun Yeh

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935053

zbMATH Keywords

integer programmingdynamic programminganalysis of algorithmscorporate tax structuring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Permutations, words, matrices (05A05) Dynamic programming (90C39)

Related Items (8)

On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ Coalition structure generation: a survey ⋮ A hybrid exact algorithm for complete set partitioning ⋮ Randomized coalition structure generation ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ Anytime coalition structure generation in multi-agent systems with positive or negative externalities ⋮ Improved WPM encoding for coalition structure generation under MC-nets ⋮ Cooperative congestion games: existence of a Nash-stable coalition structure

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm for the complete set partitioning problem
• The Set-Partitioning Problem: Set Covering with Equality Constraints

This page was built for publication: A dynamic programming approach to the complete set partitioning problem