Optimization Algorithms for Integer Networks with Side Constraints for Application in Routing and Scheduling
Final technical rept. 1 Jan-31 Dec 1992
SOUTHERN METHODIST UNIV DALLAS TX DEPT OF COMPUTER SCIENCE AND ENGINEERING
Pagination or Media Count:
This document presents a new serial and parallel algorithms for the on-to-one shortest problem. This is the current best algorithms for this problem and we believe that our software implementation is the worlds fastest code. Other algorithms for various network models, including the pure network problem, the generalized problem, the multicommodity network problem with a piecewise linear convex cost function are also presented.
- Computer Systems