A tabu search procedure for multicommodity location/allocation with balancing requirements
- 1 December 1993
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 41 (4) , 359-383
- https://doi.org/10.1007/bf02023001
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing RequirementsTransportation Science, 1993
- A branch-and-bound method for multicommodity location with balancing requirementsEuropean Journal of Operational Research, 1993
- Algorithms for the maximum satisfiability problemComputing, 1990
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search Applied to the Quadratic Assignment ProblemINFORMS Journal on Computing, 1990
- Models for multimode multicommodity location problems with interdepot balancing requirementsAnnals of Operations Research, 1989
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network DesignOperations Research, 1989
- Tabu search techniquesOR Spectrum, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986