You are not currently logged in.
Access JSTOR through your library or other institution:
A Perturbation Heuristic for a Class of Location Problems
The Journal of the Operational Research Society
Vol. 48, No. 12 (Dec., 1997), pp. 1233-1240
Stable URL: http://www.jstor.org/stable/3010753
Page Count: 8
You can always find the topics here!Topics: Heuristics, Lagrangian function, Fixed costs, Mathematical problems, Customers, Total costs, Operations research, Tabu search, Mathematical procedures, Unit costs
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
A constructive heuristic which has the flexibility of perturbing the solution while guiding the search toward a better solution is developed. Interesting findings are obtained when this heuristic is tested against reputable methods on a class of uncapacitated location problems.
The Journal of the Operational Research Society © 1997 Operational Research Society