Abstract
This paper deals with several combinatorial optimization problems. The most challenging such problem is the quadratic assignment problem (QAP). It is considered in both two dimensions (QAP) and three dimensions (Q3AP) and in the context of communication engineering. Semidefinite relaxations are used to derive lower bounds for the optimum while heuristics are applied to either find upper bounds or good feasible solutions. Semidefinite relaxations also yield bounds for questions related to binary and spherical codes including for the kissing number problem. Finally, two combinatorial problems are solved exactly, a Q3AP from communications and a directional sensor location problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Burkard, R.E., Cela, E., Karisch, S.E., Ren, F.: QAPLIB-A quadratic assignment problem library. J. Global Optim. 10, 391–403 (1997)
Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
Hannan, M., Kurtzberg, J.M.: Placement techniques. In: Breuer, M.A. (ed.) Design Automation of Digital Systems: Theory and Techniques, vol. 1, pp. 213–282. Prentice-hall, Englewood Cliffs (1972)
Taillard, E.D.: Comparison of iterative searches for the quadratic assingnment problem. Location Sci. 3, 87–105 (1995)
Burkard, R.E., Offermann, J.: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Zeitschrift für Oper. Res. 21, B121–B132 (1977)
Loiola, E.M., Maia de Abreu, N.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657–690 (2007)
Mittelmann, H.D., Peng, J.: Estimating bounds for quadratic assignment problems associated with the Hamming and Manhattan distance matrices based on semidefinite programming. SIAM J. Optim. 20, 3408–3426 (2010)
Peng, J., Mittelmann, H.D., Li, X.: A new relaxation framework for quadratic assignment problems based on matrix splitting. Math. Prog. Comp. 2, 59–77 (2010)
Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.0 beta. available at http://cvxr.com/cvx (2013)
Zhao, X., Sun, D., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737–1765 (2010)
Wu, X., Mittelmann, H.D., Wang, X., Wang, J.: On computation of performance bounds of optimal index assignment. IEEE Trans. Comm. 59(12), 3229–3233 (2011)
Wu, W., Mittelmann, H.D., Ding, Z.: Modulation design for two-way amplify-and-forward relay HARQ. IEEE Wirel. Commun. Lett. 5(3), 244–247 (2016)
Wu, W., Mittelmann, H.D., Ding, Z.: Modulation design for MIMO-CoMP HARQ. IEEE Commun. Lett. 21(2), 290–293 (2017)
Stützle, T.h.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519–1539 (2006)
Yamashita, M., Fujisawa, K., Kojima, M.: SDPA: semidefinite programming algorithm software available at https://sourceforge.net/projects/sdpa, interactive use through https://neos-server.org/neos/solvers/sdp:SDPA
Gijswijt, D.C., Mittelmann, H.D., Schrijver, A.: Semidefinite code bounds based on quadruple distances. IEEE Trans. Inf. Theory 58(5), 2697–2705 (2012)
Brouwer, A.: Table of general binary codes, available at https://www.win.tue.nl/~aeb/codes/binary-1.html
Wikipedia.: Spherical code, available at https://en.wikipedia.org/wiki/Spherical_code
Wikipedia.: Kissing number problem. availabe at https://en.wikipedia.org/wiki/Kissing_number_problem
Schütte, K., van der Waerden, B.L.: Das problem der dreizehn Kugeln. Math. Ann. 125, 325–334 (1953)
Musin, O.R.: The kissing number in four dimensions. Ann. Math. 168, 1–32 (2008)
Mittelmann, H.D., Vallentin, F.: High accuracy semidefinite programming bounds for kissing numbers. Exper. Math. 19, 174–179 (2010)
Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin (1999)
Hahn, P.M., Kim, B.J., Stützle, T., Kanthak, S., Hightower, W.L., Samra, H., Ding, Z., Guignard, M.: The quadratic three-dimensional assignment problem: exact and approximate solution methods. Eur. J. Oper. Res. 184(2), 416–428 (2008)
Margot, F.: Symmetry in integer linear programming. In: Jünger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958–2008, pp. 647–686. Springer, Berlin, (2010)
Mittelmann, H.D., Salvagnin, D.: On solving a hard quadratic 3-dimensional assignment problem. Math Prog. Comput. 7(2), 219–234 (2015)
Ragi, S., Mittelmann, H.D., Chong, E.K.P.: Directional sensor control: heuristic approaches. IEEE Sens. J. 15(1), 374–381 (2014)
Mittelmann, H.D., Salvagnin, D.: Exact and heuristic approaches for directional sensor control. IEEE Sens. J. 15(11), 6633–6639 (2015)
Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 35–59. Springer, Berlin (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Mittelmann, H.D. (2018). Combinatorial Optimization Problems in Engineering Applications. In: Al-Baali, M., Grandinetti, L., Purnama, A. (eds) Numerical Analysis and Optimization. NAO 2017. Springer Proceedings in Mathematics & Statistics, vol 235. Springer, Cham. https://doi.org/10.1007/978-3-319-90026-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-90026-1_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90025-4
Online ISBN: 978-3-319-90026-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)