Solving Linear Conditional Completely Combinatorial Optimization Problems on Permutations by the Branch and Bound Method-Reference-Cited by-同舟云学术

Solving Linear Conditional Completely Combinatorial Optimization Problems on Permutations by the Branch and Bound Method

Published:2013-03 Issue:2 Volume:49 Page:264-278
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Iemets O. O.,Yemets Ye. M.,Parfionova T. A.,Chilikina T. V.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-013-9508-1.pdf

Reference18 articles.

1. I. V. Sergienko, Mathematical Models and Methods to Solve Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1988).

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

3. I. V. Sergienko and V. P. Shilo, Discrete Optimization Problems: Challenges, Methods, Solutions, Analysis [in Russian], Naukova Dumka, Kyiv (2003).

4. Yu. G. Stoyan and O. O. Iemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. Syst. Doslidzh. Osvity, Kyiv (1993).

5. Yu. G. Stoyan, O. O. Iemets, and Ye. M. Yemets, Optimization of Polyarrangements: Theory and Methods [in Ukrainian], PUSKU, Poltava (2005).

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

1. The Polyhedral-Surface Cutting Plane Method of Optimization over a Vertex-Located Set;Communications in Computer and Information Science;2020

2. Properties of the Linear Unconditional Problem of Combinatorial Optimization on Arrangements Under Probabilistic Uncertainty;Cybernetics and Systems Analysis;2016-03