A compact quadratic model and linearizations for the minimum linear arrangement problem

• Published in: Discrete Applied Mathematics Vol. 323; pp. 134 - 148
• Main Authors: de Andrade, Rafael Castro, Bonates, Tibérius de Oliveira e, Campêlo, Manoel, Ferreira, Mardson da Silva
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 31.12.2022
• Subjects: Compact model; Linear arrangement; Mixed-integer linear programming; Quadratic programming; Valid constraints; Compact model; Quadratic programming; Linear arrangement; Mixed-integer linear programming; Valid constraints
• ISSN: 0166-218X; 1872-6771
• DOI: 10.1016/j.dam.2021.06.021

Given an undirected connected graph G=(V,E), the minimum linear arrangement problem (MinLA) consists in determining a permutation π≔(π1,…,πn) of the node-set V={1,…,n}, which minimizes the sum of edge costs |πi−πj| over all edges {i,j}∈E. We introduce a compact quadratic formulation, prove its correctness, and generate new mixed-integer linear formulations that require a very small number of variables and constraints. The idea behind the way we model permutations allows the development of strong valid constraints to strengthen the new formulations. We also adapt some cutting plane procedures from the literature to one of the new models. Computational experiments with benchmark and new instances are very encouraging and improve state-of-the-art solution approaches from the literature. •We investigate the minimum linear arrangement problem.•We propose three new compact formulations for the problem.•We develop strong constraints to strengthen the new formulations.•Theoretical results can be extended to handle problems with a permutational structure.