Votaw D F, Orden A. The personnel assignment problem [J]. Symposium on Linear Inequalities and Programming SCOOP, 1952, 10: 155-163. Kuhn H W. The Hungarian method for the assignment problem [J]. Naval Research Logistics, 1955, 2(1): 83-97. Cattrysse D G, Van Wassenhove L N. A survey of algorithms for the generalized assignment problem [J]. European Journal of Operational Research, 1992, 60(3): 260-272. Dell-Amico M, Martello S. The k-cardinality assignment problem [J]. Discrete Applied Mathematics, 1997, 76(1-3): 103-121. Prins C. An overview of scheduling problems arising in satellite communications [J]. Journal of the Operational Research Society, 1994, 45(6): 611-623. Gross O. The bottleneck assignment problem [J]. The RAND Symposium on Mathematical Programming (Linear Programming and Extensions), 1959, 3: 16-20. Martello S, Pulleyblank W R, Toth P, et al. Balanced optimization problems [J]. Operations Research Letters, 1984, 3(5): 275-278. Duin C W, Volgenant A. Minimum deviation and balanced optimization: a unified approach [J]. Operations Research Letters, 1991, 10(1): 43-48. Lee S M, Schniederjans M J. A multicriteria assignment problem: a goal programming approach [J]. Interfaces, 1993, 13(4): 75-81. Volgenant A. Solving some lexicographic multi-objective combinatorial problems [J]. European Journal of Operational Research, 2002, 139(3): 578-584. 运筹学教材编写组. 运筹学 [M]. 北京: 清华大学出报社, 2005. 高红伟, 彼得罗相[俄]. 动态合作博弈 [M]. 北京: 科学出版社, 2009. |