Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Set packing

Known as: Maximum set packing, Packing 
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Abstract Metal Additive Manufacturing (AM) has begun its revolution in various high value industry sectors through enabling… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Abstract.Given a k-uniform hypergraph, the Maximumk -Set Packing problem is to find the maximum disjoint set of edges. We prove… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
MOLREP is an automated program for molecular replacement which utilizes effective new approaches in data processing and… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We describe the capabilities of and algorithms used in a ne w FPGA CAD tool, Versatile Place and Route (VPR). In terms of… Expand
  • figure 2
  • figure 3
  • table 2
  • table 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The grouping genetic algorithm (GGA) is a genetic algorithm heavily modified to suit the structure of grouping problems. Those… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A new form of pure, solid carbon has been synthesized consisting of a somewhat disordered hexagonal close packing of soccer-ball… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1973
Highly Cited
1973
In this paper we address ourselves to identifying facets of the set packing polyhedron, i.e., of the convex hull of integer… Expand
Is this relevant?