Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem-Reference-Cited by-同舟云学术

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

Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem

Published:2017-10-31 Issue:1 Volume:71 Page:31-50
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Pereira Dilson Lucas¹,da Cunha Alexandre Salles²

Affiliation:

1. Departamento de Ciência da Computação; Universidade Federal de Lavras; Lavras Brasil

2. Departamento de Ciência da Computação; Universidade Federal de Minas Gerais; Belo Horizonte Brasil

Funder

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Fundação de Amparo à Pesquisa do Estado de Minas Gerais

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21787/fullpdf

Reference23 articles.

1. A tight linearization and an algorithm for zero-one quadratic programming problems;Adams;Manag Sci,1986

2. The quadratic minimum spanning tree problem;Assad;Naval Res Logist,1992

3. Solving the quadratic minimum spanning tree problem;Cordone;Appl Math Comput,2012

4. Matroids and the greedy algorithm;Edmonds;Math Program,1971

5. The symmetric quadratic traveling salesman problem;Fischer;Math Program,2013

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

1. Applications of Lagrangian relaxation-based algorithms to industrial scheduling problems, especially in production workshop scenarios: A review;Journal of Process Control;2024-07

2. A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization;INFORMS Journal on Computing;2024-03-12

3. A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem;Entropy;2022-12-31

4. Dynamic intersection of multiple implicit Dantzig–Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem;European Journal of Operational Research;2020-07

5. An Improved Lagrange Particle Swarm Optimization Algorithm and Its Application in Multiple Fault Diagnosis;Shock and Vibration;2020-06-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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