Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut-Reference-Cited by-同舟云学术

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

Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut

Published:2020-02 Issue: Volume:35 Page:100551
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Laroche Pierre,Marchetti Franc,Martin Sébastien,Nagih Anass,Róka Zsuzsanna

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference19 articles.

1. Matching interdiction;Zenklusen;Discrete Appl. Math.,2010

2. A Short Note on the NP-Completeness of Node-Wise Limited Matching Interdiction, Technical Report;Zenklusen,2012

3. Maximum matching and a polyhedron with 0, 1-vertices;Edmonds;J. Res. Natl. Bureau Stand.,1965

4. Matching Theory;Lovász,1986

5. Bipartite complete matching vertex interdiction problem: Application to robust nurse assignment;Laroche,2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP