Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations

Author:

de Almeida Ana Maria1,Martins Pedro2,de Souza Maurício C.3

Affiliation:

1. CISUC-Centro de Informática e Sistemas da Universidade de Coimbra and Departamento de Matemática; FCTUC; Universidade de Coimbra; Portugal

2. CIO-Centro de Investigação Operacional - FC/UL and ISCAC-Instituto Politécnico de Coimbra; Portugal

3. Departamento de Engenharia de Produção; Universidade Federal de Minas Gerais; Brasil

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Reference26 articles.

1. Almeida , A.M. Martins , P. de Souza , M.C. 2006 Min-degree constrained minimum spanning tree problem: complexity, properties and formulations Operations Research Center, University of Lisbon http://cio.fc.ul.pt/files/6.2006.pdf

2. Using Lagrangian dual information to generate degree constrained spanning trees;Andrade;Discrete Applied Mathematics,2006

3. A branch and cut method for the degree-constrained minimum spanning tree problem;Caccetta;Networks,2001

4. Duhamel , C. Gouveia , L. Moura , P. de Souza , M. 2007 Minimum cost degree constrained spanning trees with node-degree costs Operations Research Center, University of Lisbon

5. Minimal spanning trees with a constraint on the number of leaves;Fernandes;European Journal of Operational Research,1998

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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