Branch-and-Bound TSP Part-1
  • 24:09,
  • 862 views,
  • 2021-05-19,
  • 上傳者: 系統管理者,
  •  0
 
 
 
  • 1. Traveling Salesperson Optimization Problem
  • 2. The Traveling Salesperson Optimization Problem
  • 3. Step 1: A reduced cost matrix
  • 4. Step 2.1: Choose an arc with 0 cost.
  • 5. Step 2.2: Without arc (4, 6), the new lower bound is 96+32 = 128
  • 6. Step 3: With arc (4, 6), the new lower bound is 96+3 = 99
  • 7. Solve TSP Problem with Branch-and-Bound
  • 8. Arc(6, 4) is changed to be infinity since it cannot be included in the solution.Without Arc(4, 6), the lower bound is 96+32=128
1/8
Volume
  • 速度 :
  • 畫質 :
  • 播放設定
00:00/24:09
00:00/00:18
 
 
    訪客如要回應,請先 登入
      解析度 : x
      資料夾 :
      發表時間 :
      2021-05-19 13:11:02
      觀看數 :
      862
      長度 :
      24:09
      發表人 :
      系統管理者
      部門 :
      www
      QR Code :