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^*

^*此作品的通讯作者

数学科学学院

科研成果: 期刊稿件 › 文章 › 同行评审

5 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	441-449
页数	9
期刊	Optimization Methods and Software
卷	23
期	3
DOI	https://doi.org/10.1080/10556780701843405
出版状态	已出版 - 6月 2008

访问文件

10.1080/10556780701843405

其它文件与链接

链接到 Scopus 的出版物

引用此

@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

摘要

访问文件

其它文件与链接

指纹

引用此