![](images/graphics/blank.gif)
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
36
lượt xem 2
download
lượt xem 2
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
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.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD