Ứng dụng thuật toán nhánh cận để giải một số bài toán tối ưu liên quan đến chu trình Hamilton dựa trên bài toán TSP = Applications of branch-bound algorithm to solve some optimal problems related to the Hamiltonian cycle based on the TSP /
সংরক্ষণ করুন:
প্রধান লেখক: | Đỗ Như An. |
---|---|
বিন্যাস: | প্রবন্ধ |
ভাষা: | Vietnamese |
বিষয়গুলি: | |
ট্যাগগুলো: |
ট্যাগ যুক্ত করুন
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
অনুরূপ উপাদানগুলি
-
Applications of the Hamilton-Jacobi theory to the optimisation of orbital transfer /
অনুযায়ী: Popescu, Mihai. -
Một điều kiện đủ cho đồ thị Hamilton tối đại
অনুযায়ী: Đỗ, Như An
প্রকাশিত: (2011) -
On singularities in solutions to the Hamilton-Jacobi-Bellman equation /
অনুযায়ী: Kiefer, Matthew. -
Quasi-periodic homogenizations for second-order Hamilton -Jacobi-Bellman equations /
অনুযায়ী: Arisawa, M. -
The Oleinik-Lax-type formulas for multi-time Hamilton-Jacobi equations /
অনুযায়ী: Van, Tran Duc.