Optimization-based decision support algorithms for a team-in-the-loop planning experiment
暂无分享,去创建一个
[1] David L. Kleinman,et al. Maritime Headquarters with Maritime Operations Center: A Research Agenda for Experimentation , 2009 .
[2] Katta G. Murty,et al. Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..
[3] Ingemar J. Cox,et al. On Finding Ranked Assignments With Application to Multi-Target Tracking and Motion Correspondence , 1995 .
[4] Yuri N. Levchuk,et al. Normative Design of Organizations — Part I : Mission Planning , 2001 .
[5] Krishna R. Pattipati,et al. A Library of Optimization Algorithms for Organizational Design , 2005 .
[6] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[7] Krishna R. Pattipati,et al. Optimal and near-optimal algorithms for multiple fault diagnosis with unreliable tests , 1998, IEEE Trans. Syst. Man Cybern. Part C.
[8] Robert M. Freund,et al. Benders' Decomposition Methods for Structured Optimization, including Stochastic Optimization , 2001 .
[9] Y. Bar-Shalom,et al. m-best S-D assignment algorithm with application to multitarget tracking , 2001 .
[10] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[11] Krishna R. Pattipati,et al. Normative design of organizations. I. Mission planning , 2002, IEEE Trans. Syst. Man Cybern. Part A.