Criterion of an Edge of a General Polyhedron of Arrangements-Reference-Cited by-同舟云学术

Criterion of an Edge of a General Polyhedron of Arrangements

Published:2018-09 Issue:5 Volume:54 Page:796-805
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Iemets O. Ol.,Yemets’ O. Ol.,Polyakov I. M.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/article/10.1007/s10559-018-0081-5/fulltext.html

Reference33 articles.

1. I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods for Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kyiv (1981).

2. Y. G. Stoyan and O. O. Yemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Institute of System Studies of Education, Kyiv (1993). URL: http://dspace.uccu.org.ua/handle/123456789/487 .

3. Yu. G. Stoyan, O. O. Yemets, and Ye. Ì. Yemets, Optimization on Polyarrangements: Theory and Methods [in Ukrainian], RVTs PUSKU, Poltava (2005). URL: http://dspace.uccu.org.ua/handle/123456789/376 .

4. O. A. Iemets and T. N. Barbolina, Combinatorial Optimization on Arrangements [in Russian], Naukova Dumka, Kyiv (2008). URL: http://dspace.uccu.org.ua/handle/123456789/473 .

5. O. O. Yemets and O. O. Chernenko, Models of Euclidean Combinatorial Optimization [in Ukrainian], Poltava University of Economics, Poltava (2011). URL: http://dspace.uccu.org.ua/handle/123456789/354 .

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Continuous and Convex Extensions Approaches in Combinatorial Optimization;System Analysis and Artificial Intelligence;2023

2. Theory and Methods of Euclidian Combinatorial Optimization: Current Status and Prospects;Cybernetics and Systems Analysis;2020-05