Computer Science, asked by praveenkumar10000000, 10 months ago

Is it NP-hard to fill up bins with minimum moves?

Answers

Answered by Anonymous

16

Explanation:

Bin packing problem. In the bin packing problem, items of different volumes must be packed into a finite number of bins or containers each of a fixed given volume in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-hard problem.

$<b><body bgcolor=pink><marquee scrollamount="3" direction="left"><font color=red></b>ʟ ᴏ ʟ ʟ ɪ ᴘ ᴏ ᴘ ʙ ᴏ ʏ ..✌$

Previous Question

Next Question

Similar questions

English, 5 months ago

शॉर्ट पैसेज ऑन आंध्र प्रदेश कल्चर आंध्र प्रदेश ड्रेसेस...

Science, 5 months ago

व्हाट डस वन मीन बाय एग्जॉथर्मिक एंड एंडॉथर्मिक रीजंस गिव एग्जांपल...

Social Sciences, 5 months ago

Richest continent in world...

Chemistry, 10 months ago

the number of molecules present in 4g of CH4 is...

Social Sciences, 10 months ago

(2) During whose tenure was the Public Works Department established in India ?

Math, 1 year ago

if x and y are positive real numbers such that 216x³ - 343y³ =1385 and 6x²y - 7x²y = 10 , then find the value of 6x - 7y...

Math, 1 year ago

Raju father is 5 years more than three times Raju present tense find the age of Raju if his father is 44 years old...

English, 1 year ago

Why did the writer have to fly through the storm...