Fundamentals of Network Analysis |
Common terms and phrases
activity algorithm amount analysis applications assignment assumed bound branch called capacity column COMMON complete connected Consider consists constraints contains CONTINUE corresponding cost cycle defined demand determine developed directed discussed distance distribution duration elements equal equivalent event example feasible Figure float flow FORMAT formulation function given Hence illustration increased indicated initial INTEGER iteration kilter label length linear programming loop lower matrix maximal maximum method minimal network-flow node Note obtained operations optimal original out-of-kilter path period planning Plant possible presented problem procedure production reduced represent resource route schedule sequence shortest shown single sink solution solve starting Step Table task terminal tion tour transportation tree types unit upper variables zero
