MINIMUM CUTS, MODULAR-FUNCTIONS, AND MATROID POLYHEDRA

被引:34
作者
CUNNINGHAM, WH
机构
关键词
D O I
10.1002/net.3230150206
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:205 / 215
页数:11
相关论文
共 13 条
[1]   TESTING MEMBERSHIP IN MATROID POLYHEDRA [J].
CUNNINGHAM, WH .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 36 (02) :161-188
[2]  
Edmonds J., 1970, COMBINATORIAL STRUCT, P69
[3]  
FRANK A, 1984, 6TH P HUNG COMB C N, P295
[4]  
FRANK A, 1981, COMMUNICATION
[5]  
FUJISHIGE S, 1982, 82241OR U BONN REP
[6]   THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].
GROTSCHEL, M ;
LOVASZ, L ;
SCHRIJVER, A .
COMBINATORICA, 1981, 1 (02) :169-197
[7]  
HAUSMANN D, 1981, MATH PROGRAM STUD, V14, P98, DOI 10.1007/BFb0120924
[8]  
PADBERG M, 1981, CORE8138 U LOUV DISC
[9]   MAXIMAL CLOSURE OF A GRAPH AND APPLICATIONS TO COMBINATORIAL PROBLEMS [J].
PICARD, JC .
MANAGEMENT SCIENCE, 1976, 22 (11) :1268-1272
[10]   A NETWORK FLOW SOLUTION TO SOME NON-LINEAR 0-1 PROGRAMMING-PROBLEMS, WITH APPLICATIONS TO GRAPH-THEORY [J].
PICARD, JC ;
QUEYRANNE, M .
NETWORKS, 1982, 12 (02) :141-159