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 条
  • [41] A PROPERTY OF ASSIGNMENT TYPE MIXED INTEGER LINEAR-PROGRAMMING PROBLEMS
    BENDERS, JF
    VANNUNEN, JAEE
    OPERATIONS RESEARCH LETTERS, 1983, 2 (02) : 47 - 52
  • [42] Reformulation of bilevel linear fractional/linear programming problem into a mixed integer programming problem via complementarity problem
    Sharma, Anuradha
    INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2022, 15 (04) : 359 - 370
  • [43] Solving the general quadratic programming problem in a finite number of steps
    Tret'yakov, A. A.
    Tyrtyshnikov, E. E.
    DOKLADY MATHEMATICS, 2013, 88 (01) : 438 - 440
  • [44] METHODS OF SOLVING A GENERAL PROBLEM OF CONVEX QUADRATIC-PROGRAMMING
    GABASOV, R
    KIRILLOVA, FM
    RAKETSKII, VM
    DOKLADY AKADEMII NAUK SSSR, 1981, 258 (06): : 1289 - 1293
  • [45] Solving the general quadratic programming problem in a finite number of steps
    A. A. Tret’yakov
    E. E. Tyrtyshnikov
    Doklady Mathematics, 2013, 88 : 438 - 440
  • [46] Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
    Xia, Wei
    Vera, Juan
    Zuluaga, Luis F.
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (01) : 40 - 56
  • [47] An Integer Linear Programming Model for a Case Study in Classroom Assignment Problem
    Urban Rivero, Luis Eduardo
    Benitez Escarcega, Maite Regina
    Velasco, Jonas
    COMPUTACION Y SISTEMAS, 2020, 24 (01): : 97 - 104
  • [48] Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
    Meng, Leilei
    Zhang, Chaoyong
    Ren, Yaping
    Zhang, Biao
    Lv, Chang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 142
  • [49] Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
    Sadykov, R
    Wolsey, LA
    INFORMS JOURNAL ON COMPUTING, 2006, 18 (02) : 209 - 217
  • [50] Solving Hydropower Unit Commitment Problem Using a Novel Sequential Mixed Integer Linear Programming Approach
    Alireza Amani
    Hosein Alizadeh
    Water Resources Management, 2021, 35 : 1711 - 1729
12345