Optimization Online


Combinatorial Optimization Problems in Engineering Applications

Hans D Mittelmann (mittelmann***at***asu.edu)

Abstract: This paper deals with several combinatorial optimization problems. The most challenging such problem is the quadratic assignment problem. It is considered in both two dimensions (QAP) and in 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: combinatorial optimization, quadratic assignment problem, index assignment problem, modulation diversity, binary codes, kissing number, spherical codes, sensor location

Category 1: Applications -- Science and Engineering

Category 2: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 04/26/2017
Entry Accepted: 04/26/2017
Entry Last Modified: 05/11/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society