PACKING AND COVERING A TREE BY SUBTREES

被引:28
作者
BARANY, I
EDMONDS, J
WOLSEY, LA
机构
[1] HUNGARIAN ACAD SCI,INST MATH,H-1053 BUDAPEST,HUNGARY
[2] CATHOLIC UNIV LOUVAIN,CTR OP RES ECONMETR,B-1348 LOUVAIN LA NEUVE,BELGIUM
[3] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA
关键词
D O I
10.1007/BF02579383
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:221 / 233
页数:13
相关论文
共 6 条
[1]  
BARANY I, 1984, MATH PROGRAM STUD, V22, P32, DOI 10.1007/BFb0121006
[2]  
FRANK A, 1976, 5TH P BRIT COMB C CO, V15
[3]  
Gavril F., 1974, Journal of Combinatorial Theory, Series B, V16, P47, DOI 10.1016/0095-8956(74)90094-X
[4]   CONNECTED AND ALTERNATING VECTORS - POLYHEDRA AND ALGORITHMS [J].
GROFLIN, H ;
LIEBLING, TM .
MATHEMATICAL PROGRAMMING, 1981, 20 (02) :233-244
[5]  
HOFFMAN AJ, 1982, BW16582 STICH MATH C
[6]  
KOLEN AWJ, 1982, BW16382 STICHT MATH