Title of article
Effective formulationreductionsforthequadraticassignmentproblem
Author/Authors
Huizhen Zhang ، نويسنده , , CesarBeltran-Royo ، نويسنده , , MiguelConstantino ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
2007
To page
2016
Abstract
In thispaperwestudytwoformulationreductionsforthequadraticassignmentproblem(QAP).In
particularweapplythesereductionstothewellknownAdamsandJohnson [2] integer linear
programmingformulationoftheQAP.Weanalyzetwocases:Inthefirstcase,westudytheeffectof
constraintreduction. In thesecondcase,westudytheeffectof variablereduction in thecaseofasparse
cost matrix.Computationalexperimentswithasetof30QAPLIBinstances,whichrangefrom12to32
locations,arepresented.Theproposedreductionsturnedouttobeveryeffective.
Keywords
Quadratic assignment problem , Linear programming relaxation , Sparse matrix , Linear integer programming
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927806
Link To Document