A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
Số trang: 12
Loại file: pdf
Dung lượng: 205.37 KB
Lượt xem: 15
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:
Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: Generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems.
Nội dung trích xuất từ tài liệu:
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
Nội dung trích xuất từ tài liệu:
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
Tìm kiếm theo từ khóa liên quan:
Combinatorial optimization Efficient transformations Generalized combinatorial optimization problems Integer programming Graph into node setsTài liệu liên quan:
-
Minimum cost network flows: Problems, algorithms, and software
15 trang 24 0 0 -
Spectral recognition of graphs
17 trang 23 0 0 -
Ebook Operations research: Principles and applications (Second edition) - Part 2
274 trang 21 0 0 -
A cost and pipeline trade-off in a transportation problem
15 trang 20 0 0 -
18 trang 19 0 0
-
344 trang 18 0 0
-
A genetic algorithm for composing music
21 trang 16 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