AN APPLICATION OF DYNAMIC PROGRAMMING TO LOCATION-ALLOCATION PROBLEMS

Abstract

This memorandum indicates a method for treating the problem of minimizing a type of function that frequently arises in scheduling and organization theory. The technique presented here transforms the problem into a dynamic programming one, which can often be readily resolved computationally.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1964
Accession Number
AD0602474

Entities

People

  • Richard E. Bellman

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Calculus
  • Computer Programming
  • Dynamic Programming
  • Equations
  • Heuristic Methods
  • Mathematics
  • New Jersey
  • Organization Theory
  • Scheduling (Production)
  • Sequences

Fields of Study

  • Computer science

Readers

  • Operations Research