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 条
  • [31] AN EFFICIENT ALGORITHM FOR SOLVING FUZZY MULTIOBJECTIVE 0-1 LINEAR-PROGRAMMING PROBLEM
    SASAKI, M
    NAKAHARA, Y
    GEN, M
    IDA, K
    COMPUTERS & INDUSTRIAL ENGINEERING, 1991, 21 (1-4) : 647 - 651
  • [32] Optimizing model of the redeposit direction - The special 0-1 linear integer programming problem
    Gao, Tian
    Wang, Meng-Guang
    Tang, Li-Xin
    Song, Jian-Hai
    Kongzhi yu Juece/Control and Decision, 2001, 16 (SUPPL.): : 705 - 708
  • [33] On minimum cuts and the linear arrangement problem
    Horton, SB
    Parker, RG
    Borie, RB
    DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 127 - 139
  • [34] Evaluating the impact of AND/OR search on 0-1 integer linear programming
    Marinescu, Radu
    Dechter, Rina
    CONSTRAINTS, 2010, 15 (01) : 29 - 63
  • [35] LINEAR 0-1 PROGRAMMING - COMPARISON OF IMPLICIT ENUMERATION ALGORITHMS
    NARULA, SC
    KINDORF, JR
    COMPUTERS & OPERATIONS RESEARCH, 1979, 6 (01) : 47 - 51
  • [36] Evaluating the impact of AND/OR search on 0-1 integer linear programming
    Radu Marinescu
    Rina Dechter
    Constraints, 2010, 15 : 29 - 63
  • [37] An efficient 0-1 linear programming for optimal PLA folding
    Raahemifar, K
    Ahmadi, M
    ICECS 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS I-III, CONFERENCE PROCEEDINGS, 2001, : 1135 - 1138
  • [38] A new Implicit Enumeration Method for Linear 0-1 Programming
    Shao Wenwu
    Hu Wangbin
    Huang Xunjiang
    WMSO: 2008 INTERNATIONAL WORKSHOP ON MODELLING, SIMULATION AND OPTIMIZATION, PROCEEDINGS, 2009, : 298 - +
  • [39] A mixed integer linear programming formulation of the maximum betweenness problem
    Savic, Aleksandar
    Kratica, Jozef
    Milanovic, Marija
    Dugosija, Djordje
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (03) : 522 - 527
  • [40] Mixed Integer Linear Programming Formulation for the Taxi Sharing Problem
    Ben-Smida, Houssem E.
    Krichen, Saoussen
    Chicano, Francisco
    Alba, Enrique
    SMART CITIES, SMART-CT 2016, 2016, 9704 : 106 - 117
12345