Combinatorial optimization problems in engineering applications

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

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.

Original languageEnglish (US)
Title of host publicationNumerical Analysis and Optimization - NAO-IV, 2017
PublisherSpringer New York LLC
Pages193-208
Number of pages16
Volume235
ISBN (Print)9783319900254
DOIs
StatePublished - Jan 1 2018
Event4th International Conference on Numerical Analysis and Optimization, NAO-IV 2017 - Muscat, Oman
Duration: Jan 2 2017Jan 5 2017

Other

Other4th International Conference on Numerical Analysis and Optimization, NAO-IV 2017
CountryOman
CityMuscat
Period1/2/171/5/17

Fingerprint

Semidefinite Relaxation
Quadratic Assignment Problem
Engineering Application
Combinatorial Optimization Problem
Spherical Codes
Binary Code
Location Problem
Combinatorial Problems
Three-dimension
Two Dimensions
Heuristics
Lower bound
Upper bound
Engineering
Sensor
Communication
Context

Keywords

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

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Mittelmann, H. (2018). Combinatorial optimization problems in engineering applications. In Numerical Analysis and Optimization - NAO-IV, 2017 (Vol. 235, pp. 193-208). Springer New York LLC. https://doi.org/10.1007/978-3-319-90026-1_9

Combinatorial optimization problems in engineering applications. / Mittelmann, Hans.

Numerical Analysis and Optimization - NAO-IV, 2017. Vol. 235 Springer New York LLC, 2018. p. 193-208.

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

Mittelmann, H 2018, Combinatorial optimization problems in engineering applications. in Numerical Analysis and Optimization - NAO-IV, 2017. vol. 235, Springer New York LLC, pp. 193-208, 4th International Conference on Numerical Analysis and Optimization, NAO-IV 2017, Muscat, Oman, 1/2/17. https://doi.org/10.1007/978-3-319-90026-1_9
Mittelmann H. Combinatorial optimization problems in engineering applications. In Numerical Analysis and Optimization - NAO-IV, 2017. Vol. 235. Springer New York LLC. 2018. p. 193-208 https://doi.org/10.1007/978-3-319-90026-1_9
Mittelmann, Hans. / Combinatorial optimization problems in engineering applications. Numerical Analysis and Optimization - NAO-IV, 2017. Vol. 235 Springer New York LLC, 2018. pp. 193-208
@inproceedings{b136d04b33014c5bb0518ba06c2dd72f,
title = "Combinatorial optimization problems in engineering applications",
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.",
keywords = "Binary codes, Combinatorial optimization, Index assignment problem, Kissing number, Modulation diversity, Quadratic assignment problem, Sensor location, Spherical codes",
author = "Hans Mittelmann",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-90026-1_9",
language = "English (US)",
isbn = "9783319900254",
volume = "235",
pages = "193--208",
booktitle = "Numerical Analysis and Optimization - NAO-IV, 2017",
publisher = "Springer New York LLC",

}

TY - GEN

T1 - Combinatorial optimization problems in engineering applications

AU - Mittelmann, Hans

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Binary codes

KW - Combinatorial optimization

KW - Index assignment problem

KW - Kissing number

KW - Modulation diversity

KW - Quadratic assignment problem

KW - Sensor location

KW - Spherical codes

UR - http://www.scopus.com/inward/record.url?scp=85048235471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048235471&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-90026-1_9

DO - 10.1007/978-3-319-90026-1_9

M3 - Conference contribution

AN - SCOPUS:85048235471

SN - 9783319900254

VL - 235

SP - 193

EP - 208

BT - Numerical Analysis and Optimization - NAO-IV, 2017

PB - Springer New York LLC

ER -