This paper develops efficient algorithms for obtaining a dual feasible starting basis for the capacitated distribution problem. The motivation for the development of such a technique is threefold. Firstly, although efficient dual methods for solving such problems have been developed, none of...

This short note presents a formal description of a fast and robust shortest path algorithm. Modeled on an algorithm of Pape (1974), it requires less memory store than most algorithms and at the same time permits arc lengths to range between -[chi] and +[chi]. It is described in a machine...