The K ‐partitioning problem: Formulations and branch‐and‐cut
Author:
Affiliation:
1. Unité de Mathématiques Appliquées, Centre d'Etudes de Recherche en Informatique et Communication, ENSTA Paris France
2. Institut Polytechnique de Paris Paris France
3. LMI, INSA Rouen Normandie Rouen France
Publisher
Wiley
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Link
https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21944
Reference41 articles.
1. Z.Ales Extraction et partitionnement pour la recherche de régularités: Application à l'analyse de dialogues Ph.D. thesis INSA de Rouen 2014.
2. An extended edge-representative formulation for the K-partitioning problem
3. Z.Ales A.Knippel andA.Pauchet On the polyhedron of thek‐partitioning problem with representative variables Tech. report LMI/LITIS INSA de Rouen 2014.
4. Polyhedral combinatorics of the K-partitioning problem with representative variables
5. Extraction de motifs dialogiques bidimensionnels;Ales Z.;Rev. d'Intell. Artif.,2015
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A branch-and-cut algorithm for the connected max-k-cut problem;European Journal of Operational Research;2024-01
2. An Efficient Heuristic for the k-Partitioning Problem;Operations Research Forum;2023-09-28
3. Connected graph partitioning with aggregated and non‐aggregated gap objective functions;Networks;2023-08-10
4. Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations;Mathematical Programming Computation;2022-11-07
5. An overview of graph covering and partitioning;Discrete Mathematics;2022-08
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3