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.

References

  1. Amaral, A. (2009). A new lower bound for the single row facility layout problem. In Discrete Applied Mathematics, 157, pp. 183-190.
  2. Amaral, A., Caprara, A., Letchford, A., and Gonzalez, J. (2008). A new lower bound for the minimum linear arrangement of a graph. In Electronic Notes in Discrete Mathematics, 30, pp. 87-92.
  3. Amaral, A. and Letchford, A. (2011). A polyhedral approach to the single row facility layout problem. In Technical Report.
  4. Caprara, A. and Gonzalez, J. (2005). Laying out sparse graphs with provably minimum bandwidth. In INFORMS Journal on Computing, Vol. 17, No. 3, pp. 356-373.
  5. Caprara, A., Letchford, A., and Gonzalez, J. (2010). Decorous lower bounds for minimum linear arrangement. In accepted to INFORMS Journal on Computing.
  6. Caprara, A., Oswald, M., Reinelt, G., Schwarz, R., and Traversi, E. (2011). Optimal linear arrangements using betweeness variables. In Math Programming Computation, Vol. 3, pp. 261-280.
  7. Garey, M., Johnson, D., and Stockmeyer, L. (1976). Some simplified np-complete graph problems. In Theoretical Computer Science, No. 1, pp. 237-267.
  8. Horton, S. (1997). The Optimal Linear Arrangement Problem: Algorithms and Approximation. PhD Thesis, Georgia Institute of Technology.
  9. Hungerlaender, P. and Rendl, F. (2012). A computational study and survey of methods for the single-row facility layout problem. In Technical Report.
  10. Nemhauser, G. and Wolsey, L. (1998). Integer and Combinatorial Optimization. Wiley.
  11. Petit, J. (1999). Experiments on the minimum linear arrangement problem. In Technical Report.
  12. Schwarz, R. (2010). A branch-and-cut algorithm with betweenness variables for the Linear Arrangement Problem. PhD Thesis, Universitaet Heidelberg.
Download


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