文献
J-GLOBAL ID:201802222168215186
整理番号:18A0333036
2の異なる問題の交互定式化による最大最小和分散の解法【Powered by NICT】
Solving the maximum min-sum dispersion by alternating formulations of two different problems
著者 (7件):
Amirgaliyeva Zhazira
(Institute of Information and Computational Technologies, Pushkin str. 125, 050010 Almaty, Kazakhstan)
,
Amirgaliyeva Zhazira
(Al-Farabi Kazakh National University, al-Farabi prospect 71, 050040 Almaty, Kazakhstan)
,
Mladenovic Nenad
(Institute of Information and Computational Technologies, Pushkin str. 125, 050010 Almaty, Kazakhstan)
,
Mladenovic Nenad
(Mathematical Institute, Serbian Academy of Science and Arts, Knez Mihajlova 36, 11000 Belgrade, Serbia)
,
Todosijevic Raca
(Mathematical Institute, Serbian Academy of Science and Arts, Knez Mihajlova 36, 11000 Belgrade, Serbia)
,
Todosijevic Raca
(LAMIH, Universite de Valenciennes et du Hainaut Cambresis, Campus Mont Houy - 59313 Valenciennes Cedex 9, France)
,
Urosevic Dragan
(LAMIH, Universite de Valenciennes et du Hainaut Cambresis, Campus Mont Houy - 59313 Valenciennes Cedex 9, France)
資料名:
European Journal of Operational Research
(European Journal of Operational Research)
巻:
260
号:
2
ページ:
444-459
発行年:
2017年
JST資料番号:
A0547A
ISSN:
0377-2217
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)