Matchings in colored bipartite networks

Discrete Applied Mathematics

Volumn 121, Issue 1-3, 2002, Pages 261-277

  Yi, Tongnyoul ^a   Murty, Katta G ^b   Spera, Cosimo ^c  

^a Samsung SDS   (South Korea)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Saltarecom   (United States)

Author keywords

0 1 cost matrix; Assignment problem; Extreme point with specified objective value

Indexed keywords

EID: 84867952874     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00300-6     Document Type: Article

References (7)

1. R. Chandrasekaran, S.N. Kabadi, and K.G. Murty Some NP-complete problems in linear programming Oper. Res. Lett. 1 1982 101 104
2. A. Gupta, and J. Sharma Tree search method for optimal core management of pressurized water reactors Comput. oper. Res. 8 1981 263 266 (Pubitemid 12521243)
3. 5/2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2 1973 225 231
4. A.V. Karzanov, Maximum matching of given weight in complete and complete bipartite graphs, Kibernetika 1 (1987) 7-11 (English translation in: CYBNAW 23 (1) (1987) 8-13).
5. K.G. Murty Network Programming 1992 Prentice Hall Englewood Cliffs, NJ
6. C. Papadimitriou Polytopes and complexity W.R. Pulleyblank, Progress in Combinatorial Optimization 1984 Academic Press Canada, Don Mills 295 305
7. T. Yi Bipartite matchings with specified values for a 0-1 linear function, Doctoral Dissertation 1994 University of Michigan Ann Arbor, MI