'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.
Optimal assignment of facilities to locations by branch and bound
Operations Research
Operations Research ; 14 , n 2
1966
23 pages
Article (Journal)
English
© Metadata Copyright Elsevier B. V. All rights reserved.
Timetable-Based Transit Assignment Using Branch and Bound Techniques
Transportation Research Record | 2001
|An extended branch-and-bound method for locomotive assignment
Online Contents | 2006
|An extended branch-and-bound method for locomotive assignment
Elsevier | 2005
|Timetable-Based Transit Assignment Using Branch and Bound Techniques
Online Contents | 2001
|Timetable-Based Transit Assignment Using Branch and Bound Techniques
British Library Conference Proceedings | 2001
|