DPAlgorithm

An Algorithm project.A small business is faced with the following algorithmic problem. Their customers are located in k cities across the United States. It costs the small business c i,m to operate out of city i in month m. They can relocate their operations from city i to city j for a fixed cost of f ij . They are not limited on number of relocations, but must stay in a city for the entire month. Given a time horizon of n months, a plan is a sequence of n locations such that the i th location indicates the city in which they will operate in the i th month. The cost of the plan is the sum of the operating costs for each of the n months, plus the moving costs for each relocation. The plan can begin in any of the k citie