article · Defense Technical Information Center (DTIC) · 1975

The Capacitated Multi-Period Location-Allocation Problem.

Cited by 0Abstract and details only

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)

Cite this paper

APA 7

Eschenbach, T., & Carlson, R. (1975). The Capacitated Multi-Period Location-Allocation Problem. Defense Technical Information Center (DTIC).

MLA 9

Eschenbach, Ted, and Robert Carlson. “The Capacitated Multi-Period Location-Allocation Problem.” Defense Technical Information Center (DTIC), 1975.

Chicago

Eschenbach, Ted, and Robert Carlson. 1975. “The Capacitated Multi-Period Location-Allocation Problem.” Defense Technical Information Center (DTIC).

Harvard

Eschenbach, T. and Carlson, R. (1975) ‘The Capacitated Multi-Period Location-Allocation Problem’, Defense Technical Information Center (DTIC).

BibTeX

@article{eschenbach1975capacitated,
  title = {{The Capacitated Multi-Period Location-Allocation Problem.}},
  author = {Eschenbach, Ted and Carlson, Robert},
  journal = {Defense Technical Information Center (DTIC)},
  year = {1975}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.