A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem


We are concerned with the exact solution of a graph optimization problem known as minimum linear arrangement (MinLA). Define the length of each edge of a graph with respect to a linear ordering of the graph vertices. Then, theMinLA problem asks for a vertex ordering that minimizes the sum of edge lengths. MinLA has several practical applications and is NP… (More)
DOI: 10.1007/s11590-009-0130-0


1 Figure or Table