Algorithms and Applications for Generalized Networks |
Common terms and phrases
advantages algorithm amount artificial associated assumed basic basis basis exchange bound called candidate list chapter coefficient matrix column comparison complete computer code constrained contains cost cycle decision demand described determined developed directed edge effect efficient employed fact feasible Figure flow function graph implemented indicate initial involved linear programming multipliers NETG network problems node non-zero entries Note objective obtained operations optimal particular partitioning Pass paths performed Pivots Pivots Total possible presented primal prob procedures production pure quasi-tree Range reason reduced represent representation rules seconds selected shown simple simplex simplex method single solution solving Sources specialized Specifications start step stored structure supply Table techniques tested tion transportation problems transshipment problems traversal types underlying units updated values vector vertex vertices yields zero