The theoretical and empirical rate of convergence for geometric branch-and-bound methods

Journal of Global Optimization

Volumn 48, Issue 3, 2010, Pages 473-495

  Schöbel, Anita ^a   Scholz, Daniel ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Approximation algorithms; Continuous problems; Facility location problems; Geometric branch and bound; Global optimization; Non convex optimization

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND SOLUTION; CONTINUOUS PROBLEMS; CONVERGENCE THEORY; FACILITY LOCATION PROBLEMS; LOWER BOUNDS; NON-CONVEX GLOBAL OPTIMIZATION; NONCONVEX OPTIMIZATION; NUMERICAL EXPERIMENTS; RATE OF CONVERGENCE; SOLUTION APPROACH; THEORETICAL POINTS; THEORETICAL RESULT; WEBER PROBLEM;

APPROXIMATION THEORY; BRANCH AND BOUND METHOD; CONVERGENCE OF NUMERICAL METHODS; CONVEX OPTIMIZATION; GEOMETRY; GLOBAL OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 77957886956     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9502-3     Document Type: Article

References (23)

1. R. Blanquero E. Carrizosa 2009 Continuous location problems and big triangle small triangle: constructing better bounds J. Glob. Optim. 45 389 402 10.1007/s10898-008-9381-z
2. A.E. Csallner T. Csendes 1996 The convergence speed of interval methods for global optimization Comput. Math. Appl. 31 173 178 10.1016/0898-1221(95) 00229-4
3. Z. Drezner 2007 A general global optimization approach for solving location problems in the plane J. Glob. Optim. 37 305 319 10.1007/s10898-006- 9051-y (Pubitemid 46066407)
4. T. Drezner Z. Drezner 2004 Finding the optimal solution to the Huff based competitive location model Comput. Manag. Sci. 1 193 208 10.1007/s10287-004- 0009-6
5. Z. Drezner A. Suzuki 2004 The big triangle small triangle method for the solution of nonconvex facility location problems Oper. Res. 52 128 135 10.1287/opre.1030.0077 (Pubitemid 40000818)
6. J. Fernández B. Pelegrín F. Plastria B. Tóth 2007 Solving a huff-like competitive location and design model for profit maximization in the plane Eur. J. Oper. Res. 179 1274 1287 10.1016/j.ejor.2006. 02.005 (Pubitemid 46043520)
7. Hansen E.: Global Optimization Using Interval Analysis, 1st edn. Marcel Dekker, New York (1992)
8. P. Hansen D. Peeters D. Richard J.F. Thisse 1985 The minisum and minimax location problems revisited Oper. Res. 33 1251 1265 10.1287/opre.33.6.1251
9. Hiriart-Urruty J.B., Lemaréchal C.: Fundamentals of Convex Analysis, 1st edn. Springer, Berlin (2004)
10. R. Horst N.V. Thoai 1999 DC programming: overview J. Optim. Theory Appl. 103 1 43 10.1023/A:1021765131316
11. Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
12. Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization, 2nd edn. Springer, Berlin (2000)
13. Pardalos P.M., Resende M.G.C.: Handbook of Applied Optimization, 1st edn. Oxford University Press, Oxford (2002)
14. F. Plastria 1992 GBSSS: The generalized big square small square method for planar single-facility location Eur. J. Oper. Res. 62 163 174 10.1016/0377-2217(92)90244-4 (Pubitemid 23586692)
15. Ratschek H., Rokne J.: New Computer Methods for Global Optimization, 1st edn. Ellis Horwood, Chichester (1988)
16. Rockafellar R.T.: Convex Analysis, 1st edn. Princeton University Press, Princeton (1970)
17. A. Schöbel D. Scholz 2010 The big cube small cube solution method for multidimensional facility location problems Comput. Oper. Res. 37 115 122 10.1016/j.cor.2009.03.031
18. B. Tóth T. Csendes 2005 Empirical investigation of the convergence speed of inclusion functions in a global optimization context Reliab. Comput. 11 253 273 10.1007/s11155-005-6890-z (Pubitemid 40997662)
19. B. Tóth J. Fernández T. Csendes 2007 Empirical convergence speed of inclusion functions for facility location problems J. Comput. Appl. Math. 199 384 389 10.1016/j.cam.2005.07.037 (Pubitemid 44557011)
20. B. Tóth J. Fernández B. Pelegrín F. Plastria 2009 Sequential versus simultaneous approach in the location and design of two new facilities using planar huff-like models Comput. Oper. Res. 36 1393 1405 10.1016/j.cor.2008.02.006
21. Tuy H.: A general D.C. approach to location problems. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Gloabal Optimization: Computational Methods and Applications, pp. 413-432. Kluwer, Dordrecht (1996)
22. H. Tuy R. Horst 1988 Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems Math. Program. 41 161 183 10.1007/BF01580762
23. H. Tuy F. Al-Khayyal F. Zhou 1995 A D.C. optimization method for single facility location problems J. Glob. Optim. 7 209 227 10.1007/BF01097061