Show that this problem can be solved in polynomial time

Reference no: EM131936705

Assignment -

Consider the following problem: we are given a collection of customers {1, . . . , n} and a set of depots {1, ... , k}, as well as a non-negative distance matrix D such that did is the distance between customer i and depot j. We are looking for the shortest tour that visits each customer exactly once, but with the additional requirement that between visiting two customers, we must also visit one of the depots (we are allowed to use the same depot more than once). In other words, the tour alternates between customers and depots. Show that this problem can be solved in polynomial time if k is fixed.

Reference no: EM131936705

Questions Cloud

What will be the price of stock on the ex-dividend date : What will be the price of the stock on the ex-dividend date if the dividend is declared?

Determine the npv for discount rates : You are investigating the feasibility of installing a solar system at your house. You are thinking of installing 20 panels. Each panel has a capacity of 240 W.

Why fine-grain parallelism more appealing than medium-grain : From scalability point of view, why is fine-grain parallelism more appealing than medium-grain or coarse-grain parallelism for building MPP systems?

Evaluate future value of multiple annuities : Assume that you contribute $180 per month to a retirement plan for 15 years. Then you are able to increase the contribution to $380 per month for the next 25.

Show that this problem can be solved in polynomial time : In other words, the tour alternates between customers and depots. Show that this problem can be solved in polynomial time if k is fixed

Border against illegal drug smuggling : A country is considering five different strategies to protect its border against illegal drug smuggling.

With an expected return of on investments : With an expected return of 6% on his investments, how much will Mark need to save each year to reach his goal of $750,000.

Distinguish between static and dynamic dataflow computers : Distinguish between static and dynamic dataflow computers. Draw a dataflow graph showing the computations of the roots of a sequence of quadratic equations Ax?

What are the quantities described by all of your variables : A $2,000 is made on Jan 1 of 2018 and a $1,000 deposit is made on Jan 1 of 2025. Write an initial value problem to model the situation.

User Account

All Pages