Some variants of reverse selective center location problem on trees under the chebyshev and hamming norms
Số trang: 18
Loại file: pdf
Dung lượng: 159.85 KB
Lượt xem: 20
Lượt tải: 0
Xem trước 2 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree.
Nội dung trích xuất từ tài liệu:
Some variants of reverse selective center location problem on trees under the chebyshev and hamming norms
Nội dung trích xuất từ tài liệu:
Some variants of reverse selective center location problem on trees under the chebyshev and hamming norms
Tìm kiếm theo từ khóa liên quan:
Center location problems Combinatorial optimization Reverse optimization Tree graphs Time complexity Hamming normsTài liệu liên quan:
-
Ebook Introduction to the theory of computation (2/E)
440 trang 27 0 0 -
Minimum cost network flows: Problems, algorithms, and software
15 trang 24 0 0 -
Spectral recognition of graphs
17 trang 23 0 0 -
A cost and pipeline trade-off in a transportation problem
15 trang 20 0 0 -
A genetic algorithm for composing music
21 trang 16 0 0 -
12 trang 15 0 0
-
Limitation and modification: On a cost pipeline trade-off in a transportation problem
12 trang 10 0 0 -
A survey on optimization-based approaches to dynamic centralized group key management
9 trang 5 0 0