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

被引：12
|
作者：
Amaral, Andre R. S. [1 ]
机构：
[1] Univ Fed Espirito Santo, Dept Informat, BR-29060900 Vitoria, ES, Brazil
来源：
OPTIMIZATION LETTERS | 2009年 / 3卷 / 04期
关键词：
Vertex ordering problems; Minimum linear arrangement; Integer programming; QUADRATIC ASSIGNMENT PROBLEM; ALGORITHM; LINEARIZATION; GRAPHS;
D O I：
10.1007/s11590-009-0130-0
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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, the MinLA problem asks for a vertex ordering that minimizes the sum of edge lengths. MinLA has several practical applications and is NP-Hard. We present a mixed 0-1 linear programming formulation of the problem, which led to fast optimal solutions for dense graphs of sizes up to n = 23.
引用
收藏
页码：513 / 520
页数：8
相关论文
共 50 条
12345