虫虫首页|资源下载|资源专辑|精品软件
登录|注册

您现在的位置是:虫虫下载站 > 资源下载 > 人工智能/神经网络 > Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two

资 源 简 介

Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.

相 关 资 源