MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE

Abstract

It is shown that the problem of determining the minimum number of carriers required to meet a fixed schedule of transportation can be made into a linear programming problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 24, 1954
Accession Number
AD0604400

Entities

People

  • D. R. Fulkerson
  • G. B. Dantzig

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computational Science
  • Computations
  • Computer Programming
  • Hard Copy
  • Heuristic Methods
  • Integrals
  • Linear Programming
  • Mathematical Analysis
  • Scheduling (Production)
  • Sequences
  • Simplex Method
  • Transportation

Readers

  • Operations Research
  • Positioning, Navigation, and Timing (PNT) Technology.