A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints-Reference-Cited by-同舟云学术

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

A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints

Published:2018-02 Issue: Volume:64 Page:5-14
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Öncan Temel,Kuban Altınel İ.

Funder

Turkish Scientific and Technological Research Council

Galatasaray University

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. Network Flows: Theory, Algorithms and Applications;Ahuja,1993

2. A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph;Bettinelli,2016

3. Assignment Problems;Burkard,2009

4. Polynomially solvable spacial cases of the quadratic bottleneck assignment problem;Burkard;Journal of Combinatorial Optimization,2011

5. The quadratic assignment problem: theory and algorithms;Çela,1998

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

1. Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP;Computers & Operations Research;2024-06

2. Maximum weight perfect matching problem with additional disjunctive conflict constraints;Networks;2022-12-23

3. Minimum cost flow problem with conflicts;Networks;2021-02-02

4. Assignment problem with conflicts;Computers & Operations Research;2019-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP