The branch-and-bound method in Hamiltonian Rural Postman Problem
Abstract
The Hamiltonian Rural Postman Problem, which is generalization of the Hamiltonian Travelling Salesman Problem, is formulated. Modification of the classical branch-and-bound algorithm (Little’s method) which allows to find exact solution of the Hamiltonian Rural Postman Problem or correctly determine lack of solution is offered.Downloads
Published
2012-06-27
Issue
Section
Decision making and control in economic, technical, ecological and social systems