New algorithms for the minimum coloring cut problem-Reference-Cited by-同舟云学术

New algorithms for the minimum coloring cut problem

Published:2017-12-14 Issue:5 Volume:26 Page:1868-1883
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Bordini Augusto¹²,Protti Fábio¹,Silva Thiago Gouveia¹³,Sousa Filho Gilberto Farias⁴

Affiliation:

1. Universidade Federal FluminenseNiterói RJ Brazil

2. PETROBRASRio de Janeiro RJ Brazil

3. Instituto Federal de Educação, Ciência e Tecnologia da ParaíbaJoão Pessoa PB Brazil

4. Universidade Federal da ParaíbaJoão Pessoa PB Brazil

Funder

Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro

Conselho Nacional de Desenvolvimento Científico e Tecnológico

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.12494

Reference12 articles.

1. Simulated Annealing

2. Metaheuristics Comparison for the Minimum Labelling Spanning Tree Problem

3. Solving the minimum labelling spanning tree problem by intelligent optimization

4. SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES

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

1. Colored cut games;Theoretical Computer Science;2022-11

2. Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs;Theory of Computing Systems;2022-09-22

3. The edge-labeled survivable network design problem: Formulations and branch-and-cut;RAIRO - Operations Research;2022-09

4. The Labeled Two Edge Connected Subgraph Problem;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17

5. Minimum Label s-t Cut has large integrality gaps;Information and Computation;2020-12