Minimum Cost Vertex-Disjoint Path Cover Problem
碩士 === 國立臺灣科技大學 === 工業管理系 === 104 === This study presents a variant of the capacitated vehicle routing problem (CVRP), namely, the minimum cost vertex-disjoint path cover problem (MCVDPCP). In contrast to CVRP in which the vehicles start and end at the depot, vehicle routes in MCVDPCP involve a set...
Main Authors: | Christine Halim, 林貞平 |
---|---|
Other Authors: | Vincent F. Yu |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/h5f89x |
Similar Items
-
Particle Swarm Optimization for the Minimum Cost Vertex-Disjoint Path Cover Problem
by: Indri Claudia Magdalena Marpaung, et al.
Published: (2016) -
Constructing Vertex-disjoint Paths in Alternating Group Graphs
by: Lee Wen Hui, et al.
Published: (2014) -
On the Minimum Weighted Vertex Cover Problem
by: Ching-Chun Chang, et al.
Published: (2017) -
Computing k-vertex Connectivity and Disjoint s-t Paths on Permutation Graphs
by: Yi-Wen Chen, et al.
Published: (1994) -
An Exact Algorithm for Minimum Vertex Cover Problem
by: Luzhi Wang, et al.
Published: (2019-07-01)