A random search method for finding ‘K ≥ 2’ number of ranked optimal solution to an assignment problem
作者： Santosh Kumar , Ali Al-Hasani , Masar Al-Rabeeah , Andrew Eberhard
DOI: 10.1088/1742-6596/1490/1/012063
关键词:
摘要:
harvard.edu
sci-hub.st 参考文章(13)
Hanif D. Sherali, S.Elizabeth Dickey, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem Computers & Operations Research. ,vol. 13, pp. 465- 475 ,(1986) , 10.1016/0305-0548(86)90034-1
Eugene L. Lawler, A Procedure for Computing theKBest Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem Management Science. ,vol. 18, pp. 401- 405 ,(1972) , 10.1287/MNSC.18.7.401
Katta G. Murty, Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost Operations Research. ,vol. 16, pp. 682- 687 ,(1968) , 10.1287/OPRE.16.3.682
M. C. Puri, K. Swarup, Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems Zeitschrift für Operations Research. ,vol. 17, pp. 97- 105 ,(1973) , 10.1007/BF01956854
Horacio Hideki Yanasse, Nei Yoshihiro Soma, Nelson Maculan, None, An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem Pesquisa Operacional. ,vol. 20, pp. 117- 134 ,(2000) , 10.1590/S0101-74382000000100011
Santosh Kumar, Monga K. Luhandjula, Elias Munapo, Brian C. Jones, Fifty Years of Integer Programming: A Review of the Solution Approaches: Asia Pacific Business Review. ,vol. 6, pp. 5- 15 ,(2010) , 10.1177/097324701000600301
Samuel H. Brooks, A Discussion of Random Methods for Seeking Maxima Operations Research. ,vol. 6, pp. 244- 251 ,(1958) , 10.1287/OPRE.6.2.244
Bo Lu, Paul R Rosenbaum, Optimal Pair Matching With Two Control Groups Journal of Computational and Graphical Statistics. ,vol. 13, pp. 422- 434 ,(2004) , 10.1198/1061860043470
M. J. L. Kirby, H. R. Love, Kanti Swarup, Extreme Point Mathematical Programming Management Science. ,vol. 18, pp. 540- 549 ,(1972) , 10.1287/MNSC.18.9.540
R. Chandrasekaran, S. Kumar, D. Wagner, Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom Journal of Information and Optimization Sciences. ,vol. 1, pp. 41- 51 ,(1980) , 10.1080/02522667.1980.10698659