TOP

, Volume 22, Issue 1, pp 384–396

On a binary distance model for the minimum linear arrangement problem

Original Paper

DOI: 10.1007/s11750-012-0263-7

Cite this article as:
Reinelt, G. & Seitz, H. TOP (2014) 22: 384. doi:10.1007/s11750-012-0263-7
  • 123 Downloads

Abstract

The minimum linear arrangement problem consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. The problem is among the classical NP-hard optimization problems and there has been extensive research on exact and approximative algorithms. In this paper, we introduce a new model based on binary variables dijk that are equal to 1 if nodes i and j have distance k in the ordering. We analyze this model and point to connections and differences to a model using integer distance variables. Based on computational experiments, we argue that our model is worth further theoretical and practical investigation and that is has potentials yet to be examined.

Keywords

Linear arrangement problem Graph layout Integer programming 

Mathematics Subject Classification

90C10 90C27 90C57 

Copyright information

© Sociedad de Estadística e Investigación Operativa 2012

Authors and Affiliations

  1. 1.Institut für Informatik, Fakultät für Mathematik und InformatikUniversität HeidelbergHeidelbergGermany

Personalised recommendations