This paper presents six new variants of the polynomially bounded Partitioning Shortest Path (PSP) algorithm for finding the shortest path from one node to all other nodes in a network. Three of these variants, one for negative arc lengths, but without negative cycles, and two for nonnegative arc...

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 paper first presents a brief reveiw of the multicriteria problems faced by the United States Army, Navy, and Marine Corps in making enlisted personnel assignment decisions. Then for the most complex of these military assignment problems, the Marine Corps problem, a new modeling and solution...

This paper considers a distribution model with upper and lower bounds on the number of units shipped from an origin or to a destination. Our problem differs from the classical distribution model in which the node shipping amounts are, by contrast, specified exactly. This generalization of the...