Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers

被引：18
|
作者：
Zhang, Huizhen [1 ,2 ]
Beltran-Royo, Cesar [1 ]
Ma, Liang [2 ]
机构：
[1] Rey Juan Carlos Univ, Madrid, Spain
[2] Univ Shanghai Sci & Technol, Sch Management, Shanghai, Peoples R China
来源：
ANNALS OF OPERATIONS RESEARCH | 2013年 / 207卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Quadratic assignment problem; Mixed integer linear programming; FORMULATION;
D O I：
10.1007/s10479-012-1079-4
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The Quadratic Assignment Problem (QAP) can be solved by linearization, where one formulates the QAP as a mixed integer linear programming (MILP) problem. On the one hand, most of these linearizations are tight, but rarely exploited within a reasonable computing time because of their size. On the other hand, Kaufman and Broeckx formulation (Eur. J. Oper. Res. 2(3):204-211, 1978) is the smallest of these linearizations, but very weak. In this paper, we analyze how the Kaufman and Broeckx formulation can be tightened to obtain better QAP-MILP formulations. As shown in our numerical experiments, these tightened formulations remain small but computationally effective to solve the QAP by means of general purpose MILP solvers.
引用
收藏
页码：261 / 278
页数：18
相关论文
共 50 条
  • [11] Resolution of an Antenna-Satellite assignment problem by means of Integer Linear Programming
    Vazquez, Rafael
    Perea, Federico
    Galan Vioque, Jorge
    AEROSPACE SCIENCE AND TECHNOLOGY, 2014, 39 : 567 - 574
  • [12] A NUMERICAL METHOD FOR SOLVING QUADRATIC INTEGER PROGRAMMING PROBLEM
    Tat'yankin, V. M.
    Shitselov, A., V
    BULLETIN OF THE SOUTH URAL STATE UNIVERSITY SERIES-MATHEMATICAL MODELLING PROGRAMMING & COMPUTER SOFTWARE, 2019, 12 (03): : 130 - 139
  • [13] SOLVING INSTALLATION SCHEDULING PROBLEM USING MIXED INTEGER LINEAR-PROGRAMMING
    CHEN, R
    CROWDER, H
    JOHNSON, EL
    IBM SYSTEMS JOURNAL, 1978, 17 (01) : 82 - 91
  • [14] Solving the Workflow Satisfiability Problem Using General Purpose Solvers
    Karapetyan, Daniel
    Gutin, Gregory
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (06) : 4474 - 4485
  • [15] Mixed integer linear programming formulation for K-means clustering problem
    Agoston, Kolos Cs.
    E-Nagy, Marianna
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2024, 32 (01) : 11 - 27
  • [16] Mixed integer linear programming formulation for K-means clustering problem
    Kolos Cs. Ágoston
    Marianna E.-Nagy
    Central European Journal of Operations Research, 2024, 32 : 11 - 27
  • [17] Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
    Billionnet, A
    Soutif, E
    INFORMS JOURNAL ON COMPUTING, 2004, 16 (02) : 188 - 197
  • [18] Mixed integer programming and quadratic programming formulations for the interval count problem
    Medeiros, Lívia
    Oliveira, Fabiano
    Lucena, Abilio
    Szwarcfiter, Jayme
    Procedia Computer Science, 2023, 223 : 283 - 291
  • [19] THE MIXED INTEGER LINEAR BILEVEL PROGRAMMING PROBLEM
    MOORE, JT
    BARD, JF
    OPERATIONS RESEARCH, 1990, 38 (05) : 911 - 921
  • [20] Mixed integer programming and quadratic programming formulations for the interval count problem
    Medeiros, Livia
    Oliveira, Fabiano
    Lucena, Abilio
    Szwarefiter, Jayme
    XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 283 - 291
12345