What people are saying - Write a review
We haven't found any reviews in the usual places.
Deterministic Network Flows
Network Flow Optimization with
7 other sections not shown
activity aggregate problem assignment problem capacity COHHOR column commodity Consider constraints corresponding CORTIRUE cost matrix critical path cycle defined directed arcs directed network dual elements equal example feasible solution flow problem Floyd's algorithm formulation GERT given in Figure GO T3 Hungarian algorithm incidence matrix iteration kilter labeling procedure linear programming loop lower bound maximal maximum flow maximum-flow problem minimal spanning tree minimum minimum-cost moment-generating function multicommodity network shown network-flow obtained oo oo oo optimal solution out-of-kilter algorithm pair of nodes path from node production project duration project network reduced represent resource RODE route Route matrix RUHBER scheduling sequence shipment shortest path shown in Figure sink node solve source node spanning tree Step stochastic network SUBROUTIRE Table task terminal tion tour transportation problem traveling salesman problem undirected unit of flow upper bound variables vectors zero