论文信息 - Categorized bottleneck-minisum path problems on networks - 字舞流文

Categorized bottleneck-minisum path problems on networks

Oded Berman | Igor Averbakh | I. Averbakh | O. Berman

[1] C. R. Seshan. Some Generalisations of the Time Minimising Assignment Problem , 1981 .

[2] V. Aggarwal. The assignment problem under categorized jobs , 1983 .

[3] Lie-Fern Hsu,et al. Bottleneck assignment problems under categorization , 1986, Comput. Oper. Res..

[4] Oded Berman,et al. The Constrained Bottleneck Problem in Networks , 1990, Oper. Res..

[5] Abraham P. Punnen,et al. Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization , 1992, Discret. Appl. Math..

[6] Abraham P. Punnen,et al. On: Travelling salesman problem under categorization: Operations Research Letters 12 (1992) 89-95 , 1993, Oper. Res. Lett..