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 条
  • [21] Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
    Soylu, Banu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 245 (03) : 690 - 703
  • [22] Exact response bound analysis of truss structures via linear mixed 0-1 programming and sensitivity bounding technique
    Du, Jianming
    Du, Zongliang
    Wei, Yihai
    Zhang, Weisheng
    Guo, Xu
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2018, 116 (01) : 21 - 42
  • [23] Sensitivity analysis for 0-1 linear programming problems
    Thiongane, B
    Nagih, A
    Plateau, G
    RAIRO-OPERATIONS RESEARCH, 2003, 37 (04) : 291 - 309
  • [24] Deep cuts in concave and linear 0-1 programming
    Khamisov, O. V.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2014, 20 (02): : 294 - 304
  • [25] Formulation of document summarization as a 0-1 nonlinear programming problem
    Alguliev, Rasim M.
    Aliguliyev, Ramiz M.
    Isazade, Nijat R.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 64 (01) : 94 - 102
  • [26] An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem
    Catanzaro, Daniele
    Engelbeen, Celine
    ALGORITHMS, 2015, 8 (04): : 999 - 1020
  • [27] Constraint violation reduction search for 0-1 mixed integer linear programming problems
    Bansal, Ankit
    Uzsoy, Reha
    ENGINEERING OPTIMIZATION, 2021, 53 (04) : 609 - 626
  • [28] Minimization of the 0-1 linear programming problem under linear constraints by using neural networks: synthesis and analysis
    Univ of Montreal, Montreal, Canada
    IEEE Trans Circuits Syst I Fundam Theor Appl, 5 (421-425):
  • [29] Minimization of the 0-1 linear programming problem under linear constraints by using neural networks: Synthesis and analysis
    Aourid, M
    Kaminska, B
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1996, 43 (05): : 421 - 425
  • [30] Method for solving 0-1 multiple Objective Linear Programming problem using DEA
    Jahanshahloo, GR
    Hosseinzadeh, F
    Shoja, N
    Tohidi, G
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2003, 46 (02) : 189 - 202
12345