GREEDY CONCEPTS FOR NETWORK FLOW PROBLEMS

被引：6

作者：

BEIN, WW ^{[1
]}

BRUCKER, P ^{[1
]}

机构：

[1] UNIV OSNABRUCK,FACHBEREICH MATH INFORMAT,D-4500 OSNABRUCK,FED REP GER

来源：

DISCRETE APPLIED MATHEMATICS | 1986年 / 15卷 / 2-3期

关键词：

D O I：

10.1016/0166-218X(86)90037-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

MATHEMATICAL PROGRAMMING

引用

页码：135 / 144

页数：10

共 10 条

[1]

Anderson, 1985, SURVEYS COMBINATORIC, P97

[2]

BARNES ER, 1985, SIAM J ALGEBRAIC DIS, V3, P487

[3] MINIMUM COST FLOW ALGORITHMS FOR SERIES-PARALLEL NETWORKS [J].

BEIN, WW ;

BRUCKER, P ;

TAMIR, A .

DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) :117-124

[4]

BERN MW, 1985, LINEAR TIME COMPUTAT

[5]

BRUCKER P, 1982, 8TH P C GRAPH THEOR, P25

[6]

BRUCKER P, 1984, TOPICS OPERATIONS RE, P299

[7]

FEDERGRUEN A, 1983, GREEDY PROCEDURE RES

[8] SEQUENCING 1 STATE-VARIABLE MACHINE - SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1964, 12 (05) :655-&

[9]

Lovasz L, 1982, MATH PROGRAMMING STA, P235, DOI DOI 10.1007/978-3-642-68874-4_10

[10] THE RECOGNITION OF SERIES-PARALLEL DIGRAPHS [J].

VALDES, J ;

TARJAN, RE ;

LAWLER, EL .

SIAM JOURNAL ON COMPUTING, 1982, 11 (02) :298-313

← 1 →