Combinatorial optimization problems in engineering applications

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationNumerical Analysis and Optimization - NAO-IV, 2017
EditorsLucio Grandinetti, Mehiddin Al-Baali, Anton Purnama
PublisherSpringer New York LLC
Number of pages16
ISBN (Print)9783319900254
StatePublished - 2018
Event4th International Conference on Numerical Analysis and Optimization, NAO-IV 2017 - Muscat, Oman
Duration: Jan 2 2017Jan 5 2017

Publication series

NameSpringer Proceedings in Mathematics and Statistics
ISSN (Print)2194-1009
ISSN (Electronic)2194-1017


Other4th International Conference on Numerical Analysis and Optimization, NAO-IV 2017


  • Binary codes
  • Combinatorial optimization
  • Index assignment problem
  • Kissing number
  • Modulation diversity
  • Quadratic assignment problem
  • Sensor location
  • Spherical codes

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Combinatorial optimization problems in engineering applications'. Together they form a unique fingerprint.

Cite this