Approximation of Euclidean k-size cycle cover problem
For a fixed natural number k, a problem of k collaborating salesmen servicing the same set of cities (nodes of a given graph) is studied. We call this problem the Minimumweight k-size cycle cover problem (or Min-k-SCCP) due to the fact that the problem has the following mathematical statement. Let a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Croatian Operational Research Society
2014-12-01
|
| Series: | Croatian Operational Research Review |
| Subjects: | |
| Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=197356 |