| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4626905 | Applied Mathematics and Computation | 2015 | 8 Pages |
Abstract
Some hard-to solve combinatorial problems of finding several disjoint discrete structures in complete weighted graph are considered. Efficient algorithms with performance guarantees are constructed for the Euclidean m-Peripatetic Salesman Problem, m-Weighted Clique Problem and m-Layer Planar three-index Assignment Problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Edward Kh. Gimadi,