Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- 1 June 1995
- journal article
- Published by Springer Science and Business Media LLC in OR Spectrum
- Vol. 17 (2), 113-123
- https://doi.org/10.1007/bf01719254
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Toward a Taxonomy of Parallel Tabu Search HeuristicsINFORMS Journal on Computing, 1997
- A branch-and-bound algorithm for depot location and container fleet managementLocation Science, 1995
- A tabu search procedure for multicommodity location/allocation with balancing requirementsAnnals of Operations Research, 1993
- Massively parallel tabu search for the quadratic assignment problemAnnals of Operations Research, 1993
- A branch-and-bound method for multicommodity location with balancing requirementsEuropean Journal of Operational Research, 1993
- A connectionist approach to the quadratic assignment problemComputers & Operations Research, 1992
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Models for multimode multicommodity location problems with interdepot balancing requirementsAnnals of Operations Research, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986