Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Search by:

Year of publication
Author name
Paper title

Algorithm solving the problem of optimal function by method of branch and bound

Leonova M.1
1 Poltava V.G. Korolenko National Pedagogical University

Full text (PDF)

UDC: 519.85
Publication Language: Ukrainian
Stuc. intelekt. 2013; 18(2):14–20

Abstract: A new (combinatorial) model assignment problem. The features of the method branch and bound for solving the assignment problem. Improved assessment of admissible sets in branch and bound, the algorithm for solving the problem and illustrate it with an example.

Keywords: method branch and bound, the task of appointment, evaluation of subsets, optimization on permutations

References:

  1. Sergienko I.V. Modeli i metody reshenija na JeVM kombinatornyh zadach optimizacii / I.V. Sergienko,M.F. Kaspshickaja – K. : Naukova dumka, 1981. – 288 s.
  2. Muha V.S. Zadacha uchenogo raspisanija: postanovka i reshenie / V.S. Muha // Problemy upravlenija iinformatiki. – 2012 – № 6. – S. 125-135.
  3. Stojan Ju.G. Teorіja і metodi evklіdovoї kombіnatornoї optimіzacії [Elektronnij resurs] / Ju.G. Stojan,O.O. Єmec'. – K. : Іn-t sistemn. doslіdzhen' osvіti, 1993. – 188 s. – Rezhim dostupu :http://dspace.uccu.org.ua/handle/123456789/487.
  4. Єmec' O.O. Transportnі zadachі kombіnatornogo tipu: vlastivostі, rozv’jazuvannja, uzagal'nennja[Elektronnij resurs] / O.O. Єmec', T.O. Parf'onova. – Poltava : PUET, 2011. – 174 s. – Rezhim dostupu :http://dspace.uccu.org.ua/handle/123456789/353.
  5. Єmec' O.O. Rozv’jazuvannja zadach kombіnatornoї optimіzacії na nechіtkih mnozhinah [Elektronnijresurs] / O.O. Єmec', Ol-ra O. Єmec'. – Poltava : PUET, 2011. – 239 s. – Rezhim dostupu :http://dspace.uccu.org.ua/handle/123456789/352.
  6. Linejnoe i nelinejnoe programmirovanie / I.N. Ljashenko, E.A. Karagodova, N.V. Chernishova, N.Z.Shor ; [pod obshh. red. I.N. Ljashenko]. – Kiev : Vishha shk., 1975. – 372 s.

View full text (PDF)