Abstract: If each vertex in a connected graph is labeled such that the values correspond one-to-one with the natural number set from 1 to the sum of vertices and edges, and if the sum of labels of ...
Abstract: Two-echelon vehicle routing problem (2E-VRP) is an NP-hard combinatorial optimization problem and a basic mathematical model of modern city logistics. While it is difficult to obtain the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback