Scribd
Upload
12 views6 pages

Bin Packing, Vertex Cover, Set Cover

The document discusses the Bin Packing Problem, which involves packing objects of varying volumes into a limited number of bins to minimize the number of bins used. It is classified as an NP-Hard problem with variations including packing by cost, weight, linear packing, and 2D packing. The complexity of the problem is O(nlogn), where n represents the number of elements to be packed, and it has practical applications in container filling and loading trucks.

Uploaded by

I Kaizoku
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views6 pages

Bin Packing, Vertex Cover, Set Cover

The document discusses the Bin Packing Problem, which involves packing objects of varying volumes into a limited number of bins to minimize the number of bins used. It is classified as an NP-Hard problem with variations including packing by cost, weight, linear packing, and 2D packing. The complexity of the problem is O(nlogn), where n represents the number of elements to be packed, and it has practical applications in container filling and loading trucks.

Uploaded by

I Kaizoku
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Unit 5

Vertex cover problem


The set cover problem
Bin Packing Problem
• Objects of different volumes must be packed into a finite number of
bins or containers each of volume Vin a way that minimizes the no of
bins used.
• NP-Hard problem
• Variations:-
-Packing by cost
-Packing by weight
-Linear Packing
-2D Packing
• Applications:-
-Filling up containers
-Loading Trucks with weight capacity constraints,etc.
-Knapsack Problem.

Complexity—O(nlogn),where n=no of elements to be packed.

You might also like