A NETWORK FLOW SOLUTION TO SOME NON-LINEAR 0-1 PROGRAMMING-PROBLEMS, WITH APPLICATIONS TO GRAPH-THEORY

被引：59

作者：

PICARD, JC ^{[1
]}

QUEYRANNE, M ^{[1
]}

机构：

[1] UNIV HOUSTON,HOUSTON,TX 77004

来源：

关键词：

D O I：

10.1002/net.3230120206

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：141 / 159

页数：19

共 19 条

[1] SELECTION PROBLEM [J].

BALINSKI, ML .

MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03) :230-231

[2]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[3]

Ford L. R., 1962, FLOWS NETWORKS

[4]

GALIL Z, 1979, ACM S THEORY COMPUTI, V11, P13

[5]

HAMMER PL, 1965, OPER RES, V13, P388

[6]

HANSEN P, 1974, THESIS U LIBRE BRUXE

[7]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[8]

Karzanov A. V, 1974, SOV MATH DOKL, V15, P434

[9]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

[10]

Lawler EL., 1978, ANN DISCRETE MATH, V2, P75