Second order cone programming relaxation for quadratic assignment problems

Yong Xia

doi:10.1080/10556780701843405

Second order cone programming relaxation for quadratic assignment problems

Yong Xia^*

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

We present a second order cone programming relaxation with O(n2) variables for quadratic assignment problems, which provides a lower bound not less than the well-known quadratic programming bound. It is further strengthened by additional linear inequalities.

Original language	English
Pages (from-to)	441-449
Number of pages	9
Journal	Optimization Methods and Software
Volume	23
Issue number	3
DOIs	https://doi.org/10.1080/10556780701843405
State	Published - Jun 2008

Keywords

Quadratic assignment problem
Quadratic programming bound
Second order cone programming

Access to Document

10.1080/10556780701843405

Cite this

@article{3ca76ced3575456a890451064556ebe7,

title = "Second order cone programming relaxation for quadratic assignment problems",

abstract = "We present a second order cone programming relaxation with O(n2) variables for quadratic assignment problems, which provides a lower bound not less than the well-known quadratic programming bound. It is further strengthened by additional linear inequalities.",

keywords = "Quadratic assignment problem, Quadratic programming bound, Second order cone programming",

author = "Yong Xia",

year = "2008",

month = jun,

doi = "10.1080/10556780701843405",

language = "英语",

volume = "23",

pages = "441--449",

journal = "Optimization Methods and Software",

issn = "1055-6788",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - Second order cone programming relaxation for quadratic assignment problems

AU - Xia, Yong

PY - 2008/6

Y1 - 2008/6

N2 - We present a second order cone programming relaxation with O(n2) variables for quadratic assignment problems, which provides a lower bound not less than the well-known quadratic programming bound. It is further strengthened by additional linear inequalities.

AB - We present a second order cone programming relaxation with O(n2) variables for quadratic assignment problems, which provides a lower bound not less than the well-known quadratic programming bound. It is further strengthened by additional linear inequalities.

KW - Quadratic assignment problem

KW - Quadratic programming bound

KW - Second order cone programming

UR - https://www.scopus.com/pages/publications/46349090179

U2 - 10.1080/10556780701843405

DO - 10.1080/10556780701843405

M3 - 文章

AN - SCOPUS:46349090179

SN - 1055-6788

VL - 23

SP - 441

EP - 449

JO - Optimization Methods and Software

JF - Optimization Methods and Software

IS - 3

ER -

Second order cone programming relaxation for quadratic assignment problems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this