An extended formulation of the convex recoloring problem on a tree-Reference-Cited by-同舟云学术

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

An extended formulation of the convex recoloring problem on a tree

Published:2016-11-30 Issue:2 Volume:165 Page:529-548
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Chopra Sunil,Filipecki Bartosz,Lee Kangbok,Ryu Minseok,Shim Sangho,Van Vyve Mathieu

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/article/10.1007/s10107-016-1094-3/fulltext.html

Reference23 articles.

1. Bar-Yehuda, R., Feldman, I., Rawitz, D.: Improved approximation algorithm for convex recoloring of trees. Theory Comput. Syst. 43, 3–18 (2008)

2. Campêlo, M., Huiban, C.G., Sampaio, R.M., Wakabayashi, Y.: On the complexity of solving or approximating convex recoloring problems. Lect. Notes Comput. Sci. 7936, 614–625 (2013)

3. Campêlo, M., Lima, K.R., Moura, P., Wakabayashi, Y.: Polyhedral studies on the CR problem. Electron. Notes Discret. Math. 44, 233–238 (2013)

4. Campêlo, M., Freire, A.S., Lima, K.R., Moura, P., Wakabayashi, Y.: The convex recoloring problem: polyhedra, facets and computational experiments. Math. Progr. 156, 303–330 (2016)

5. Chopra, S., Owen, J.L.: Extended formulations for the A-cut problem. Math. Progr. 73, 7–30 (1996)

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

1. Strong inequalities and a branch-and-price algorithm for the convex recoloring problem;European Journal of Operational Research;2022-11

2. Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem;INFORMS Journal on Computing;2022-05

3. A heuristic for the convex recoloring problem in graphs;International Transactions in Operational Research;2020-11-06

4. Strong intractability results for generalized convex recoloring problems;Discrete Applied Mathematics;2020-07

5. Mixed-integer programming techniques for the connected max-k-cut problem;Mathematical Programming Computation;2020-04-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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