- Title
- Preprocessing and cutting for multiple allocation hub location problems
- Creator
- Boland, Natashia; Krishnamoorthy, Mohan; Ernst, Andreas T.; Ebery, Jamie
- Relation
- European Journal of Operational Research Vol. 155, Issue 3, p. 638-653
- Publisher Link
- http://dx.doi.org/10.1016/S0377-2217(03)00072-9
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2004
- Description
- In this paper we consider formulations and solution approaches for multiple allocation hub location problems. We present a number of results, which enable us to develop preprocessing procedures and tightening constraints for existing mixed integer linear programming formulations. We employ flow cover constraints for capacitated problems to improve computation times. We present the results of our computational experience, which show that all of these steps can effectively reduce the computational effort required to obtain optimal solutions.
- Subject
- location; integer programming; hub location; nodes
- Identifier
- http://hdl.handle.net/1959.13/939396
- Identifier
- uon:12794
- Identifier
- ISSN:0377-2217
- Language
- eng
- Reviewed
- Hits: 1687
- Visitors: 1647
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|