A New Mathematical Model For the Minimum Linear Arrangement Problem

Mahdi Moeini, Serigne Gueye, Sophie Michel Loyal

2014

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.

Paper Citation

in Harvard Style

Moeini M., Gueye S. and Michel Loyal S. (2014). A New Mathematical Model For the Minimum Linear Arrangement Problem . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 57-62. DOI: 10.5220/0004827800570062

in Bibtex Style

@conference{icores14,
author={Mahdi Moeini and Serigne Gueye and Sophie Michel Loyal},
title={A New Mathematical Model For the Minimum Linear Arrangement Problem},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={57-62},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004827800570062},
isbn={978-989-758-017-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A New Mathematical Model For the Minimum Linear Arrangement Problem
SN - 978-989-758-017-8
AU - Moeini M.
AU - Gueye S.
AU - Michel Loyal S.
PY - 2014
SP - 57
EP - 62
DO - 10.5220/0004827800570062