Abstract
Stochastic methods have recently been applied to continuous non-linear optimization problems. In this paper we begin to investigate whether these methods could be useful for discrete optimization problems. Specifically we focus our attention on sampling and clustering methods, to investigate whether they help in reducing the computational effort needed to solve uncapacitated and capacitated location problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.G.E. Boender, A.H.G. Rinnooy Kan, L. Stougie and G.T. Timmer, “A stochastic method for global optimization”, Mathematical Programming 12 (1982) 125–140.
P. Camerini, A. Colorni and F. Maffioli, “Some experience in applying a stochastic method to location problems”, Technical Report LCE83-3, Dipartimento di Elettronica, Politecnico (Milano, Italy, 1983).
A.A. Kuehn and M.J. Hamburger, “A heuristic program for locating warehouses”, Management Science 9 (1963) 643–666.
S. Lin, “Computer solutions of the traveling salesman problem”, Bell System Technical Journal 44 (1965) 2245–2269.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Camerini, P.M., Colorni, A., Maffioli, F. (1986). Some experience in applying a stochastic method to location problems. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121102
Download citation
DOI: https://doi.org/10.1007/BFb0121102
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00922-8
Online ISBN: 978-3-642-00923-5
eBook Packages: Springer Book Archive