The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut

Author:

Cornaz D.,Magnouche Y.,Mahjoub A.R.,Martin S.

Funder

FMJH program PGMO

ADF-THALES-ORANGE-CRITEO

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference22 articles.

1. On the minimum cut separator problem;Ben-Ameur;Networks,2012

2. Multiway cuts in node weighted graphs;Garg;J. Algorithms,2004

3. Parameterized graph separation problems;Marx;Theoret. Comput. Sci.,2006

4. Simple and improved parameterized algorithms for multiterminal cuts;Xiao;Theory Comput. Syst.,2010

5. The optimal multiterminal cut problem;Cunningham,1989

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

1. A Graph Multi-separator Problem for Image Segmentation;Journal of Mathematical Imaging and Vision;2024-08-12

2. Integer programming models and polyhedral study for the geodesic classification problem on graphs;European Journal of Operational Research;2024-05

3. A note on the SDP relaxation of the minimum cut problem;Journal of Global Optimization;2022-09-29

4. Towards the Identification of Maximal Coherent Cut-Sets Within Power Grids;2021 IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe);2021-10-18

5. The multi-terminal vertex separator problem: Branch-and-Cut-and-Price;Discrete Applied Mathematics;2021-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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