A Greedy Algorithm for the Transhipment along a Single Road Problem.

Abstract

This paper presents a specialized algorithm for the transhipment along a single line problem. The problem is a specially structured network flow problem for which basis structure is such that a greedy algorithm can be employed for solution. The specialized algorithm is on the order of a hundred times faster than the primal simplex method on a graph. Additional keywords: Fortran, Cost Effectiveness, Naval Research. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1984
Accession Number
ADA152343

Entities

People

  • A. I. Ali

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Cyber
  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Computations
  • Contracts
  • Governments
  • Simplex Method
  • Transportation
  • United States
  • United States Government
  • Universities

Readers

  • Operations Research