## An Algorithm for a General Class of Routine Problems Derived from Huygens' Principle |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

algorithm is approximately algorithm is comparable approximately 3N words associated costs auxiliary storage c(Iq CLASS OF ROUTING closed loop control complete optimal control control or node cost contour cost distance cost elements data core storage discretized optimal control dynamic programing envelope of secondary flag forbidden transition Ford and Fulkerson given node goal node goal subset Iq to node Jr,j l)th iteration Langley Research Center loop control philosophy microseconds N2 Step node Iq node transition nonnegative cost associated number of nodes number of operations number of paths occupied node occupied status Operation Total optimal control field optimal control problem optimal path problem optimal transition ordered pair originating at node Output loop steps parallelogram path cost path from Ig path from node Principle rapid-access data storage set equal sketch slow-access storage starting node storage and maximum theorem Tk+1 Tk+i unoccupied wave front originating yields a global