IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v2y1970i3p341-356.html
   My bibliography  Save this article

The Location Problem of Given and Indivisible Different Units

Author

Listed:
  • G. Jándy

    (Budapest Technical University)

Abstract

In cases where certain simplifications are allowed, the location optimisation of given and indivisible different economic units may be modelled as a bi-value weighted distribution problem. The paper presents a heuristic algorithm for this network-flow-type problem and also a partial enumeration algorithm for deriving the exact solution. But it is also pointed out that an initial sub-optimal solution can quickly be improved with a derivation on a direct line only, if the exact solution is not absolutely essential. A numerical example is used to illustrate the method of derivation on a direct line starting with an upper bound given by a sub-optimal solution.

Suggested Citation

  • G. Jándy, 1970. "The Location Problem of Given and Indivisible Different Units," Environment and Planning A, , vol. 2(3), pages 341-356, September.
    • Handle: RePEc:sae:envira:v:2:y:1970:i:3:p:341-356
    DOI: 10.1068/a020341
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a020341
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a020341?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:envira:v:2:y:1970:i:3:p:341-356. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.