ON THE ACYCLIC SUBGRAPH POLYTOPE

被引：58

作者：

GROTSCHEL, M

JUNGER, M

REINELT, G

机构：

[1] Univ Augsburg, Inst fuer Mathematik,, Augsburg, West Ger, Univ Augsburg, Inst fuer Mathematik, Augsburg, West Ger

来源：

关键词：

D O I：

10.1007/BF01582009

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

MATHEMATICAL TECHNIQUES

引用

页码：28 / 42

页数：15

共 8 条

[1] Garey Michael R., 1979, COMPUTERS INTRACTABI
[2] A CUTTING PLANE ALGORITHM FOR THE LINEAR ORDERING PROBLEM
GROTSCHEL, M
JUNGER, M
REINELT, G
[J]. OPERATIONS RESEARCH, 1984, 32 (06) : 1195 - 1220
[3] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION
GROTSCHEL, M
LOVASZ, L
SCHRIJVER, A
[J]. COMBINATORICA, 1981, 1 (02) : 169 - 197
[4] GROTSCHEL M, 1985, MATH PROGR, V33, pR20
[5] A BRANCH AND BOUND ALGORITHM FOR THE ACYCLIC SUBGRAPH PROBLEM
KAAS, R
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 8 (04) : 355 - 362
[6] MINIMAX THEOREM FOR DIRECTED GRAPHS
LUCCHESI, CL
YOUNGER, DH
[J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1978, 17 (JUN): : 369 - 374
[7] LUCCHESI CL, 1976, THESIS U WATERLOO WA
[8] [No title captured]