The Capacitated Multi-Period Location-Allocation Problem.

Abstract

The problem is that of locating capacitated plants at some of a number of potential locations, so as to minimize the discounted sum of fixed costs incurred for open plants and variable supply costs. Both the costs and demands may vary arbitrarily over time. The results of optimal LIFO branch-and-bound and of heuristic algorithms using various branching variable selection rules and some new bounds are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1975
Accession Number
ADA020341

Entities

People

  • Robert C. Carlson
  • Ted Eschenbach

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms

Readers

  • Industrial Economics
  • Operations Research