Question: Problem 3. (30 points) Let G = (V, E) be un undirected graph, whose nodes represent the cities, which need to be patrolled by Crime

Problem 3. (30 points) Let G = (V, E) be un

Problem 3. (30 points) Let G = (V, E) be un undirected graph, whose nodes represent the cities, which need to be patrolled by Crime watch police units. The units are located on the nodes of the graph. There are two types of units: fixed and mobile. A fixed unit located at node i patrols only that city. A mobile unit at node i can defend the city (node) i and all the neighboring cities. Every fixed unit has a cost of 2 while a mobile unit costs 3. The goal is to defend all the nodes of the graph at the minimum cost. Formulate an integer LP to solve the problem. Problem 3. (30 points) Let G = (V, E) be un undirected graph, whose nodes represent the cities, which need to be patrolled by Crime watch police units. The units are located on the nodes of the graph. There are two types of units: fixed and mobile. A fixed unit located at node i patrols only that city. A mobile unit at node i can defend the city (node) i and all the neighboring cities. Every fixed unit has a cost of 2 while a mobile unit costs 3. The goal is to defend all the nodes of the graph at the minimum cost. Formulate an integer LP to solve the

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!