Preprocessing and cutting for multiple allocation hub location problems [An article from: European Journal of Operational Research] | ![Preprocessing and cutting for multiple allocation hub location problems [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: N. Boland, M. Krishnamoorthy, A.t. Ernst, J Ebery
Publisher: Elsevier
Category: Book
Buy New: $5.95
Format: Html
Media: Digital
Publication Date: June 16, 2004
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
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.
|
|
|
