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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 22, 1993
Accession Number
ADA265254

Entities

People

  • B. D. Stewart
  • Jeffery L. Kennington
  • Rajluxmi V. Murthy
  • Richard V. Helgason

Organizations

  • Southern Methodist University

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Artificial Intelligence
  • Computer Programming
  • Computer Science
  • Computers
  • Engineering
  • Flow Network
  • Linear Programming
  • Lists (Data Structures)
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Orientation (Direction)
  • Parallel Computing
  • Plastic Explosives
  • Simplex Method
  • Systems Science

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.