What people are saying - Write a review
We haven't found any reviews in the usual places.
THE MULTICOMMODITY DISTRIBUTION PROBLEM
PRICEDIRECTIVE DECOMPOSITION OF MULTI
RESOURCEDIRECTIVE DECOMPOSITION OF THE MULTI
3 other sections not shown
acyclic algorithm A2 algorithms developed arc costs arc lengths arc-chain-cycle bundle chain and cycle chain from node chain of negative chain or cycle Chapter commodity keK commodity sinks constraints convex Dantzig-Wolfe Decomposition David Cantor Decomposition Algorithms define denote dual solution feasible solution Ford-Fulkerson algorithm Fulkerson go to step growing areas initial arc allocation inverse Lemma Leonard Kleinrock linear programming lower bound computation major iteration master problem matrix minor iterations multi-commodity distribution problem MULTI-COMMODITY FLOWS Multi-Commodity Network multi-terminal shortest chain negative length Network Flows non-negative numbers O1 OOO2 optimal solution ORSA orthant primal primal solution problem P5 Quebec City regional warehouse reoptimize the master rH rH rH section 3.2 shortest chain algorithm shortest chain problem solving the master subproblem tableau Test Problem P3 University of California upper bound vector vk(yk