A transport improvement problem transformable to a best-path problem
U.S. Dept. of Transportation, Transport Systems Planning Division, 1967 - Technology & Engineering - 26 pages
12 pages matching problem P(k,R in this book
Results 1-3 of 12
What people are saying - Write a review
We haven't found any reviews in the usual places.
algorithm as given allocation to i,j applied to N*;A arc i,j arc-simple ascent step best-path algorithm best-path problem budget level Bureau of Standards containing all arcs CORRIDOR TRANSPORTATION PROJECT D(iQ d*-value defined denoted disutility function enlarged network N*;A ensemble of problems feasible allocation go to Step GOLDMAN NATIONAL BUREAU horizontal step improved network IMPROVEMENT PROBLEM TRANSFORMABLE initial subpath initialize D(j jeN-S JOHNS HOPKINS UNIVERSITY L-th layer L-th pass label D(i,u label-correcting algorithm labels D(j minimum total disutility multiplies the number NEMHAUSER JOHNS HOPKINS node ifN node-simple path non-negative integers NORTHEAST CORRIDOR TRANSPORTATION optimal allocation optimal improvement problem optimization problems particular node pass through Step path from origin path in N*;A permanent-label algorithm problem P(k,R proper subset sequence of sublists set A(i,j set D(j set in Step solution solving the best-path Step h system-wide improvement terminal subpaths TRANSPORT IMPROVEMENT PROBLEM traversal disutility undefined value of D(j