A heuristic for the convex recoloring problem in graphs-Reference-Cited by-同舟云学术

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

A heuristic for the convex recoloring problem in graphs

Published:2020-11-06 Issue:3 Volume:29 Page:1454-1478
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Dantas Ana Paula S.¹^ORCID,de Souza Cid C.¹^ORCID,Dias Zanoni¹^ORCID

Affiliation:

1. Institute of Computing University of Campinas (Unicamp) Av. Albert Einstein Campinas São Paulo 1251 Brazil

Funder

Fundação de Amparo à Pesquisa do Estado de São Paulo

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

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

Reference19 articles.

1. Networks: expanding evolutionary thinking

2. Improved Approximation Algorithm for Convex Recoloring of Trees

3. The convex recoloring problem: polyhedra, facets and computational experiments;Campêlo M.B.;Mathematical Programming,2016

4. Campêlo M.B. Huiban C.G. Sampaio R.M. Wakabayashi Y. 2013. On the complexity of solving or approximating convex recoloring problems. Proceedings of the 19th International Computing and Combinatorics Conference (COCOON'2013) Springer Berlin Heidelberg pp.614–625.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP