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 ...
Abstract: We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback