Accession Number : ADA265254


Title :   Optimization Algorithms for Integer Networks with Side Constraints for Application in Routing and Scheduling


Descriptive Note : Final technical rept. 1 Jan-31 Dec 1992


Corporate Author : SOUTHERN METHODIST UNIV DALLAS TX DEPT OF COMPUTER SCIENCE AND ENGINEERING


Personal Author(s) : Kennington,, Jeffery L ; Helgason, Richard V ; Stewart, B D ; Murthy, Rajluxmi V


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a265254.pdf


Report Date : 22 Feb 1993


Pagination or Media Count : 119


Abstract : 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 world's 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.


Descriptors :   *ALGORITHMS , *OPTIMIZATION , *COMPUTER NETWORKS , MATHEMATICAL MODELS , STATE OF THE ART , AIR FORCE PLANNING , COSTS , SCHEDULING , ROUTING


Subject Categories : Computer Systems


Distribution Statement : APPROVED FOR PUBLIC RELEASE