A New Mathematical Model For the Minimum Linear Arrangement Problem

Abstract

This paper addresses a classical combinatorial optimization problem called the Minimum Linear Arrangement (MinLA) Problem. The MinLA problem has numerous applications in different domains of science and engineering. It is known to be NP-hard for general graphs. The objective of this paper is to introduce a new mathematical model and associated theoretical results, including novel rank inequalities. Preliminary computational experiments are reported on some benchmark instances.