Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Search by:

Year of publication
Author name
Paper title

Линейные условные задачи комбинаторной оптимизации на перестановках и их решение

Iemets O.1, Yemets E.1, Parfionova J.1, Chilikina T.1
1 Poltava University of economics and trade

Full text (PDF)

UDC: 519.85
Publication Language: Ukrainian
Stuc. intelekt. 2011; 16(2):131-136

Abstract: In the article the hypothetical linear fully combinatorial task of optimization on transpositions is considered. It is suggested to solve it by the branch-and-bound method. Certain three possible variants of evaluation of possible subsets in the branch-and-bound method. The rules of branching and pruning of possible subsets in the branch-and-bound method for the hypothetical linear combinatorial task of optimization at transpositions are offered.

Keywords:

References:

  1. Sergienko I.V. Kiev : Naukova dumka. 1988. 472 p.
  2. Sergienko I.V. Kiev : Naukova dumka. 1981. 288 p.
  3. Sergienko I.V. Kiev : Naukova dumka. 2003. 263 p.
  4. Stojan Ju.G. Kiev : Іnstytut systemnih doslіdzhen' osvіty. 1993. 188 p.
  5. Stojan Ju.G. Poltava : RVC PUSKU. 2005. 103 p.
  6. Emec O.A. Kiev : UMK VO. 1992. 92 p.
  7. Emec O.A. Poltava : RVC PUSKU. 2006. 129 p.
  8. Emec O.A. Kiev : Naukova dumka. 2005. 117 p.
  9. Emec O.A. Kiev : Naukova dumka. 2008. 159 p.
  10. Emec O.A Naukovі vіstі NTUU «KPІ». 2010.№ 1. P. 21-28
  11. Emec O.A. Kibernetika i sistemnyj analiz. 2010. № 5. P. 1-7
  12. Ermol'evJu.M. Kiev : Vishha shkola. Golovnoe izd-vo.1979. 312 p.
  13. Ljashenko I.N. Kiev : Vishha shkola. 1975. 372 p.

View full text (PDF)