BRANCH CHOICE IN A BRANCH-AND-BOUND METHOD

  • Юрий Максимович Бастриков Odessa National Polytechnic University
  • Людмила Ивановна Протасова Odessa National Polytechnic University

Abstract

The algorithm of branches choicing used for branching of search of decision tree in a branch-and-bound is offered in the article. An estimation allowing to shorten decision search branching amount at the decision of task of traveling salesman tree is offered. The algorithm of task decision is offered. An example of task decision with the use of the offered estimation is given

Author Biographies

Юрий Максимович Бастриков, Odessa National Polytechnic University

Cand. tech. sciences, associate professor

Людмила Ивановна Протасова, Odessa National Polytechnic University

Senior Lecturer

Published
2019-02-25
How to Cite
Бастриков, Ю., & Протасова, Л. (2019). BRANCH CHOICE IN A BRANCH-AND-BOUND METHOD. Electrotechnic and Computer Systems, (10(86), 92-97. Retrieved from https://eltecs.op.edu.ua/index.php/journal/article/view/1406
Section
Automation of control processes

Most read articles by the same author(s)