.png){kind=icon}
返回
The labeled maximum matching problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.05.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the labeled maximum matching problem. It is a relatively new problem whose application is related to the timetabling problem, We prove it is NP-complete and present four different mathematical formulations. Moreover, we propose an exact algorithm based on a branch-and-bound approach to solve it. We evaluate the performance of our algorithm on a wide set of instances and compare our computational times with the ones required by CPLEX to solve the proposed mathematical formulations. Test results show the effectiveness of our procedure, that hugely outperforms the solver. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Matching
Label
Color
Exact approach
Branch and bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Immediate Effects of a Hippotherapy Session on Gait Parameters in Children with Spastic Cerebral Palsy海马疗法对痉挛性脑瘫儿童步态参数的即时影响
OAAI
OAAI分享收藏
查看更多内容