A GRAPH-THEORETIC APPROACH TO A CLASS OF INTEGER-PROGRAMMING PROBLEMS

被引：16

作者：

DESLER, JF

HAKIMI, SL

机构：

来源：

关键词：

D O I：

10.1287/opre.17.6.1017

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1017 / &

共 18 条

[1]

Berge C., 1962, THEORY GRAPHS

[2]

Charnes A., 1954, NAV RES LOG, V1, P301, DOI DOI 10.1002/NAV.3800010408

[3]

Dantzig G.B., 1963, LINEAR PROGRAMMING

[4]

DESLER JF, 1969, THESIS NORTHWESTERN

[5] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[6] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[7]

Ford Lester R., 1962, FLOWS NETWORKS

[8] OPTIMAL MATCHINGS + DEGREE-CONSTRAINED SUBGRAPHS [J].

GOLDMAN, AJ .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1964, B 68 (01) :27-+

[9]

Hitchcock F.L., 1941, J MATH PHYS, V20, P224, DOI DOI 10.1002/SAPM1941201224

[10]

Kuhn H. W., 1956, NAV RES LOGIST Q, V3, P253, DOI [DOI 10.1002/NAV.38000304040143.42001, 10.1002/nav.3800030404, DOI 10.1002/NAV.3800030404]