Solving Linear Unconstrained Problems of Combinatorial Optimization on Arrangements Under Stochastic Uncertainty-Reference-Cited by-同舟云学术

Solving Linear Unconstrained Problems of Combinatorial Optimization on Arrangements Under Stochastic Uncertainty

Published:2016-05 Issue:3 Volume:52 Page:457-466
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Iemets O. O.,Barbolina T. M.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-016-9846-x.pdf

Reference18 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. I. V. Sergienko, L. F. Hulianytskyi, and S. I. Sirenko, “Classification of applied methods of combinatorial optimization,” Cybern. Syst. Analysis, 45, No. 5, 732–741 (2009).

3. G. P. Donets and L. M. Kolechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], RVV PUET, Poltava (2011), http://dspace.puet.edu.ua/handle/123456789/560 .

4. Y. G. Stoyan, M. V. Zlotnik, and A. M. Chugay, “Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region,” J. Oper. Research Soc., 63, 379–391 (2012).

5. O. O. Iemets and T. M. Barbolina, Combinatorial Optimization on Arrangements [in Russian], Naukova Dumka, Kyiv (2008), http://dspace.puet.edu.ua/handle/123456789/473 .

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

1. Criterion of an Edge of a General Polyhedron of Arrangements;Cybernetics and Systems Analysis;2018-09