haku: @indexterm location problem / yhteensä: 219
viite: 4 / 219
| Tekijä: | Boland, N. (et al.) |
| Otsikko: | Preprocessing and cutting for multiple allocation hub location problems |
| Lehti: | European Journal of Operational Research
2004 : JUN, VOL. 155:3, p. 638-653 |
| Asiasana: | Location problem Integer programming |
| Kieli: | eng |
| Tiivistelmä: | In this paper the authors consider formulations and solution approaches for multiple allocation hub location problems. The authors present a number of results, which enabled them to develop preprocessing procedures and tightening constraints for existing mixed integer linear programming formulations. Flow cover constraints for capacitated problems are employd to improve computation times. Results show that all of these steps can effectively reduce the computational effort required to obtain optimal solutions. |
SCIMA