摘要
本文研究一类从时间表理论中提出的连续型匹配问题一元素在连续区间内匹配．作为完美匹配存在的充要条件，我们证明了Hall型定理，并说明其在算法上的应用．
As a counterpart of the discrete matching problem for bipartite graphs，this paperstudies a continuous matching problem（arising from scheduling theory） as follows：Given a family of intervals a perfect matching of A is a bijection from N to afamily of open unit intervals such that and Some necessaryand sufficient conditions for the existence of perfect matchings are proved．Also，some related algorithms are presented．
出处
《运筹学学报》
CSCD
1998年第4期82-90,共9页
Operations Research Transactions
基金
国家自然科学基金!19771075
