Hong, S.-P., Cho, S.-J., & Park, M.-J. (2009). A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. European Journal of Operational Research, 193(2), 351–364.

Home Hong, S.-P., Cho, S.-J., & Park, M.-J. (2009). A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. European Journal of Operational Research, 193(2), 351–364.

Hong, S.-P., Cho, S.-J., & Park, M.-J. (2009). A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. European Journal of Operational Research, 193(2), 351–364.

저자

Hong, S.-P., Cho, S.-J., & Park, M.-J.

저널 정보

European Journal of Operational Research, 193(2), 351–364

출간연도

2009

링크

https://doi.org/10.1016/j.ejor.2007.10.048

경영과학 연구실Operations Research Lab

Hong, S.-P., Cho, S.-J., & Park, M.-J. (2009). A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. European Journal of Operational Research, 193(2), 351–364.

Hong, S.-P., Cho, S.-J., & Park, M.-J. (2009). A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. European Journal of Operational Research, 193(2), 351–364.

경영과학 연구실