MATCHING PROBLEM WITH SIDE CONDITIONS

被引：56

作者：

CORNUEJOLS, G ^{[1
]}

PULLEYBLANK, W ^{[1
]}

机构：

[1] UNIV CALGARY,DEPT COMP SCI,CALGARY T2N 1N4,ALBERTA,CANADA

来源：

关键词：

D O I：

10.1016/0012-365X(80)90002-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：135 / 159

页数：25

共 12 条

[1]

Balinski M, 1972, J COMBINATORIAL THEO, V13, P1

[2]

Chvatal V., 1973, Mathematical Programming, V5, P29, DOI 10.1007/BF01580109

[3] 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-+

[4]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

[5]

HAUSMANN D, 78110 U BONN I OP RE

[6]

Hoffman A, 1978, ANN DISCRETE MATH, V2, P201

[7]

Lovasz L., 1979, ANN DISCRETE MATH, V4, P141

[8]

NEMHAUSER GL, 1976, COMMUNICATION

[9]

PAPADIMITRIOU CH, 1978, COMMUNICATION

[10]

Pulleyblank W., 1973, THESIS U WATERLOO