Write the assignment problem matrix below as a network flow problem. Assume that the numbers in each cell represent the travel distance required between nodes. The dash indicates that there is not a route between nodes.
$$\begin{array} { | c | c | c | c | }
\hline & \text { A } & \text { B } & \text { C } \
\hline 1 & 4 & 6 & - \
\hline 2 & - & 2 & 1 \
\hline 3 & 3 & 5 & 9 \
\hline
\end{array}$$

Question

Write the assignment problem matrix below as a network flow problem. Assume that the numbers in each cell represent the travel distance required between nodes. The dash indicates that there is not a route between nodes.
 $$\begin{array} { | c | c | c | c | } 
\hline & \text { A } & \text { B } & \text { C } \
\hline 1 & 4 & 6 & - \
\hline 2 & - & 2 & 1 \
\hline 3 & 3 & 5 & 9 \
\hline
\end{array}$$

Quizplus · Accepted Answer

The Answer of Write the assignment problem matrix below as a network flow problem. Assume that the numbers in each cell represent the travel distance required between nodes. The dash indicates that there is not a route between nodes.
 $$\begin{array} { | c | c | c | c | } 
\hline & \text { A } & \text { B } & \text { C } \
\hline 1 & 4 & 6 & - \
\hline 2 & - & 2 & 1 \
\hline 3 & 3 & 5 & 9 \
\hline
\end{array}$$

Write the Assignment Problem Matrix Below as a Network Flow