A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables

European Journal of Operational Research

Volumn 232, Issue 2, 2014, Pages 266-275

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

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Branch and bound methods; Combinatorial optimization; Facility location problems; Global optimization; Mixed integer optimization; Non convex optimization

Indexed keywords

ALGORITHM FOR SOLVING; CONTINUOUS VARIABLES; FACILITY LOCATION PROBLEM; GEOMETRIC BRANCH AND BOUNDS; GLOBAL OPTIMIZATION PROBLEMS; MIXED INTEGER OPTIMIZATION; NONCONVEX OPTIMIZATION; RATES OF CONVERGENCE;

ALGORITHMS; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; LOCATION;

PROBLEM SOLVING;

EID: 84883825890     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.07.003     Document Type: Article

References (41)

1. R. Blanquero, and E. Carrizosa Continuous location problems and big triangle small triangle: Constructing better bounds Journal of Global Optimization 45 2009 389 402
2. R. Blanquero, E. Carrizosa, and P. Hansen Locating objects in the plane using global optimization techniques Mathematics of Operations Research 34 2009 837 858
3. R. Blanquero, E. Carrizosa, A. Schöbel, and D. Scholz A global optimization procedure for the location of a median line in the three-dimensional space European Journal of Operational Research 215 2011 14 20
4. Blomer, V., & Schöbel, A. (2012). Twins of powerful numbers. Functiones et Approximatio (in press).
5. P. Bonami, L. Biegler, A. Conn, G. Cornuejols, I. Grossmann, and C. Laird An algorithmic framework for convex mixed-integer nonlinear programs Discrete Optimization 5 2008 186 204
6. J. Brimberg, P. Hansen, and N. Mladenović Decomposition strategies for large-scale continuous location-allocation problems IMA Journal of Management Mathematics 17 2006 307 316
7. J. Brimberg, P. Hansen, N. Mladenović, and S. Salhi A survey of solution methods for the continuous location-allocation problem International Journal of Operations Research 5 2008 1 12
8. J. Brimberg, N. Mladenović, and S. Salhi The multi-source Weber problem with constant opening cost Journal of the Operational Research Society 55 2004 640 646
9. C. Buchheim, and G. Rinaldi Efficient reduction of polynomial zero-one optimization to the quadratic case SIAM Journal on optimization 18 2007 1398 1413
10. P.C. Chen, P. Hansen, B. Jaumard, and H. Tuy Solution of the multisource Weber and conditional Weber problems by D.-C. programming Operations Research 46 1998 548 562
11. Z. Drezner The planar two-center and two-median problems Transportation Science 18 1984 351 361
12. T. Drezner, and Z. Drezner Equity models in planar location Computational Management Science 4 2007 1 16
13. Z. Drezner, K. Klamroth, A. Schöbel, and G. Wesolowsky The Weber problem Z. Drezner, H.W. Hamacher, Location theory - Applications and theory 2001 Springer 1 36
14. Z. Drezner, and S. Nickel Constructing a DC decomposition for ordered median problems Journal of Global Optimization 45 2009 187 201
15. Z. Drezner, and S. Nickelm Solving the ordered one-median problem in the plane European Journal of Operational Research 195 2009 46 61
16. Z. Drezner, and A. Suzuki The big triangle small triangle method for the solution of nonconvex facility location problems Operations Research 52 2004 128 135
17. D. Elvikis, H.W. Hamacher, and M.T. Kalsch Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem Journal of Scheduling 12 2009 361 374
18. J. Fernández, B. Pelegrín, F. Plastria, and B. Tóth Planar location and design of a new facility with inner and outer competition: An interval lexicographical-like solution procedure Networks and Spatial Economics 7 2007 19 44
19. M.R. Garey, and D.S. Johnson Computers and intractability - A guide to the theory of NP-completeness 1979 Freeman San Francisco
20. H.W. Hamacher, and T. Meyer New developments on hub locations Computers & Operations Research 36 2009 3087 3290
21. Hemmecke, R., Köppe, M., Lee, J., & Weismantel, R. (2010). Nonlinear integer programming. In: 50 Years of integer programming. Springer.
22. R. Horst, P.M. Pardalos, and N.V. Thoai Introduction to global optimization 2nd ed. 2000 Springer Berlin
23. Hübner, R., & Schöbel, A. (2011). When is rounding allowed? A new approach to integer nonlinear optimization. Technical report, Institut für Numerische und Angewandte Mathematik.
24. M.T. Kalsch, and Z. Drezner Solving scheduling and location problems in the plane simultaneously Computers & Operations Research 37 2010 256 264
25. J.B. Lasserre Global optimization with polynomials and the problem of moments SIAM Journal Optimization 11 3 2001 796817
26. N. Megiddo, and K.J. Supowit On the complexity of some common geometric location problems SIAM Journal on Computing 13 1984 182 196
27. G.L. Nemhauser, and L.A. Wolsey Integer and combinatorial optimization 1st ed. 1999 Wiley-Interscience New York
28. S. Nickel, and J. Puerto Location theory. A unified approach 1st ed. 2005 Springer Berlin
29. P.M. Pardalos, and S.A. Vavasis Quadratic programming with one negative eigenvalue is NP-hard Journal of Global Optimization 1991 15 22
30. F. Pfeuffer, M. Stiglmayr, and K. Klamroth Discrete and geometric branch and bound algorithms for medical image registrations Annals of Operations Research 196 2012 737 765
31. F. Plastria GBSSS: The generalized big square small square method for planar single-facility location European Journal of Operational Research 62 1992 163 174
32. F. Plastria, and M. Elosmani On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems TOP 16 2008 388 406
33. G. Righini, and L. Zaniboni A branch-and-price algorithm for the multisource Weber problem International Journal of Operational Research 2 2007 188 207
34. A. Schöbel, and D. Scholz The big cube small cube solution method for multidimensional facility location problems Computers & Operations Research 37 2010 115 122
35. A. Schöbel, and D. Scholz The theoretical and empirical rate of convergence for geometric branch-and-bound methods Journal of Global Optimization 48 2010 473 495
36. D. Scholz Deterministic global optimization: Geometric branch-and-bound methods and their applications 1st ed. 2012 Springer New York
37. D. Scholz Theoretical rate of convergence for interval inclusion functions Journal of Global Optimization 53 2012 749 767
38. Suzuki, A. (2012). Big triangle small triangle algorithm for the multi-weber problem. Talk held at ISOLDE XII, Nagoya and Kyoto.
39. H. Tuy Convex analysis and global optimization 1st ed. 1998 Kluwer Academic Publisher Dordrecht
40. H. Tuy, and R. Horst Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems Mathematical Programming 41 1988 161 183
41. E.V. Weiszfeld Sur le point pour lequel la somme des distances de n points donné est minimum Tohoku Mathematical Journal 43 1937 335 386