ADJACENCY ON POLYMATROIDS

被引：11

作者：

TOPKIS, DM

机构：

来源：

关键词：

D O I：

10.1007/BF02591887

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：229 / 237

页数：9

共 29 条

[1]

BALAS E, 1979, RAIRO-RECH OPER, V13, P3

[2] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING [J].

BALAS, E ;

PADBERG, M .

[3] SET-COVERING PROBLEM [J].

BALAS, E ;

PADBERG, MW .

[4] ASSIGNMENT POLYTOPE [J].

BALINSKI, ML ;

RUSSAKOFF, A .

[5]

BALINSKI ML, 1972, MATH PROGRAM, V3, P257

[6]

BIXBY RE, UNPUB MATH OPERATION

[7] CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].

CHVATAL, V .

[8]

CHVATAL V, 1978, SOCS789 MCGILL U SCH

[9]

CUNNINGHAM WH, 1981, WP81207 U BONN DEP O

[10]

Edmonds J., 1970, COMBINATORIAL STRUCT, P69