Combinatorial Optimization Problem - Greedy Algorithm - Engineering Assignment Help

Assignment Task :

1 Instructions 

This assignment must be completed individually, the deadline is on May 2nd 2020 at 23.59 CET. To complete the assignment, you need to upload the following files to the course’s IOL page (where a specific link will be available): 

• One Python file named FIRSTNAME LASTNAME.py, with the code you have developed. 

• One PDF file name FIRSTNAME LASTNAME.pdf, preferably produced by way of LATEX, in- cluding a description of the algorithms you designed, the relevant parts of the Python code you wrote, and the experimental results. 

2 The Problem 

Suppose you are a researcher who needs to move all her equipment to a new workplace on the other side of the world, where she just got a new job. Her research equipment consists of n objects, the i-th object having a weight equal to wi kilograms. The way the researcher is supposed to send her equipment is by way of containers. Each container has enough space capacity to contain an arbitrary amount of objects, in principle all the n objects. There is however a constraint: each container is, for structural reasons, able to carry at most C kilograms, where C is typically smaller than ∑ni=1 wi, but higher than each of the wi. In other words, the researcher needs more than one container, each of them costing a fixed amount p to be sent. The problem the researcher faces, then, is allocating the objects to as few containers as possible, this way minimizing the cost of shipping all the n objects to their final destination. 

This assignment asks you to: 

1. Model the problem described above as a combinatorial optimization problem (actually one we have encountered at some point in our course). 

2. Give an exhaustive search algorithm solving the combinatorial problem from the previous point, and analyse the algorithm’s complexity: give an upper bound to the worst-case com- putation time, in big O notation, in function of n. 

3. Give a greedy algorithm that solves the same combinatorial problem from point 1 (or more precisely, that gives an approximate solution), and analyse the algorithm’s complexity. Again, the bound should be a function on n. Give an upper bound to the approxima- tion ratio of this algorithm (that is to say, the ratio of the cost of the solution it proposes to the cost of the optimal solution). 

This Engineering Assignment has been solved by our Engineering Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.