Andere Kunden interessierten sich auch für
![Sphere packing]( "Sphere packing")
Sphere packing25,99 €![Packing Problem]( "Packing Problem")
Packing Problem29,99 €![Packing in a Hypergraph]( "Packing in a Hypergraph")
Packing in a Hypergraph22,99 €![MIRUP Conjecture for Bin Packing in Low Dimension]( "MIRUP Conjecture for Bin Packing in Low Dimension")
MIRUP Conjecture for Bin Packing in Low Dimension32,99 €![Solving Non-standard Packing Problems by Global Optimization and Heuristics]( "Solving Non-standard Packing Problems by Global Optimization and Heuristics")
Solving Non-standard Packing Problems by Global Optimization and Heuristics37,99 €![Generalized Network Improvement and Packing Problems]( "Generalized Network Improvement and Packing Problems")
Generalized Network Improvement and Packing Problems48,99 €![Introduction to Cutting and Packing Optimization]( "Introduction to Cutting and Packing Optimization")
Introduction to Cutting and Packing Optimization95,99 €
High Quality Content by WIKIPEDIA articles! Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k subsets in the list are pairwise disjoint (in other words, no two of them intersect). The problem is clearly in NP since, given k subsets, we can easily verify that they are pairwise disjoint. The optimization version of the problem, maximum set packing, asks for the maximum number of pairwise disjoint sets in the list. It is a maximization problem that can be formulated naturally as an integer linear program, belongs to the class of packing problems, and its dual linear program is the set cover problem.