Skip to main content
SpringerLink
Log in

Site Location via Mixed-integer Programming

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

It is demonstrated that mixed-integer programming can be applied successfully to the solution of certain practical site location problems. A mixed-integer model of a frequently occurring form of warehouse location problem is presented. Experience with models of this type is described with examples of computational performance. The flexibility of mixed-integer models and the approach to their use as aids to decision-making are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. S.I.A. Ltd.,

    D. G. Elson

Authors
  1. D. G. Elson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elson, D. Site Location via Mixed-integer Programming. J Oper Res Soc 23, 31–43 (1972). https://doi.org/10.1057/jors.1972.4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1972.4

Search

Navigation