A new relaxation framework for quadratic assignment problems based on matrix splitting-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A new relaxation framework for quadratic assignment problems based on matrix splitting

Published:2010-02-23 Issue:1 Volume:2 Page:59-77
ISSN:1867-2949
Container-title:Mathematical Programming Computation
language:en
Short-container-title:Math. Prog. Comp.

Author:

Peng Jiming,Mittelmann Hans,Li Xiaoxue

Publisher

Springer Science and Business Media LLC

Subject

Software,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s12532-010-0012-6.pdf

Reference30 articles.

1. Adams, W.P., Johnson, T.A.: Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems, DIMACS 25 Series in Discrete Mathematics and Theoretical Computer Science, pp. 43–75 (1994)

2. Adams W.P., Sherali H.D.: A tight linearization and an algorithm for zero-one quadrtic programming problems. Manage. Sci. 32, 1274–1290 (1986)

3. Anstreicher K.M., Brixius N.W.: A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 80, 341–357 (2001)

4. Anstreicher K.M., Brixius N.W., Goux J.-P., Linderoth J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91, 563–588 (2002)

5. Ben-David G., Malah D.: Bounds on the performance of vector-quantizers under channel errors. IEEE Trans. Inf. Theory 51(6), 2227–2235 (2005)

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem;International Journal of Industrial Engineering Computations;2022

2. Soft Graph Matching: Submodular Relaxation and Lovasz Extension;2020 IEEE International Conference on Data Mining (ICDM);2020-11

3. Spectral Alignment of Graphs;IEEE Transactions on Network Science and Engineering;2020-07-01

4. Graph Matching via the lens of Supermodularity;IEEE Transactions on Knowledge and Data Engineering;2020

5. Dynamic Sparsification for Quadratic Assignment Problems;Mathematical Optimization Theory and Operations Research;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3