Question

Consider the following problem in E-commerce:

As a warehouse worker, you must fulfill incoming customer orders from your website.

First, a machine hands you the physical items in each order. You must then find the appropriate shipping container for each order and arrange all items into the container. Each container has a three-dimensional maximum capacity (height, length, width). If no container can accommodate all of the items in the order, you must appropriately divide the order into multiple containers, attempting to use as few total containers as possible, in order to save on shipping costs.

Which commonly known NP-complete problem in mathematics does the above problem most closely reduce to?

Select the best option:
A.
Minimum Spanning Tree

B.
Vertex Cover

C.
Travelling Salesman

D.
Factoring

E.
Knapsack​

Answer 1

Answer:

Ans a is ok

Explanation:

Ans a

Answer 2

Answer:

A

Explanation: