'Distance' between any pair of locations is index of cost of transporting unit of material between locations; `traffic intensity' is rate at which units of material are transferred between given pair of facilities in both directions; optimal assignment is one in which sum of product of distance times traffic intensity for all pairs of facility-location assignments is minimum; branch-and-bound technique with modifications is used to give optimal assignment.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    Optimal assignment of facilities to locations by branch and bound


    Weitere Titelangaben:

    Operations Research


    Beteiligte:
    Gavett, J.W. (Autor:in) / Plyter, N.V. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1966


    Format / Umfang :

    23 pages


    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch


    Schlagwörter :


    Timetable-Based Transit Assignment Using Branch and Bound Techniques

    Friedrich, Markus / Hofsaess, Ingmar / Wekeck, Steffen | Transportation Research Record | 2001


    Timetable-Based Transit Assignment Using Branch and Bound Techniques

    Friedrich, M. / Hofsaess, I. / Wekeck, S. et al. | British Library Conference Proceedings | 2001


    An extended branch-and-bound method for locomotive assignment

    Rouillon, Stéphane / Desaulniers, Guy / Soumis, François | Elsevier | 2005



    An extended branch-and-bound method for locomotive assignment

    Rouillon, Stéphane | Online Contents | 2006