Branch‐and‐cut algorithms for the ‐arborescence star problem-Reference-Cited by-同舟云学术

Branch‐and‐cut algorithms for the ‐arborescence star problem

Published:2020-08-12 Issue:4 Volume:29 Page:2374-2400
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Pereira Armando Honorio¹^ORCID,Mateus Geraldo Robson¹^ORCID,Urrutia Sebastián¹²^ORCID

Affiliation:

1. Computer Science Department Federal University of Minas Gerais Belo Horizonte – MG 31270‐901 Brazil

2. Faculty of Logistics Molde University College Molde 6410 Norway

Funder

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Conselho Nacional de Desenvolvimento Científico e Tecnológico

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

Publisher

Wiley

Subject

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

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12857

Reference38 articles.

1. A survey on clustering algorithms for wireless sensor networks

2. Wireless sensor networks: a survey

3. The Capacitatedm-Ring-Star Problem

4. A Benders decomposition based framework for solving cable trench problems

5. On the shortest arborescence of a directed graph;Chu Y.J.;Scientia Sinica,1965

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

1. Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times;Algorithms;2023-12-27

2. Precedence-Constrained arborescences;European Journal of Operational Research;2023-06

3. Compact Models for the Precedence-Constrained Minimum-Cost Arborescence Problem;Advances in Transdisciplinary Engineering;2023-03-30

4. A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines;International Transactions in Operational Research;2022-01-11

5. Maximum weighted induced forests and trees: new formulations and a computational comparative review;International Transactions in Operational Research;2021-10-31