|
|
|
This repository contains algorithms for the Travelling Salesperson *Problem with Circle Placement* **(TSP-CP)** and related subproblems: *Travelling Salesperson Problem with Self-deleting graphs* **(TSP-SD)** and *Weak Path-Conforming Circle Placement Problem* **(WPCCP)**.
|
|
|
|
This repository contains algorithms for the Travelling Salesperson *Problem with Circle Placement* **(TSP-CP)**, its Dubins variant (DTSP-CP) and related subproblems: *Travelling Salesperson Problem with Self-deleting graphs* **(TSP-SD)** and *Weak Path-Conforming Circle Placement Problem* **(WPCCP)**.
|
|
|
|
|
|
|
|
# Weak Path-Conforming Circle Placement Problem (WPCCP)
|
|
|
|
WPCCP was first introduced in the paper *[Where to place a pile?](https://www.researchgate.net/publication/374246979_Where_to_Place_a_Pile)*.
|
| ... | ... | @@ -32,4 +32,8 @@ url = {https://www.sciencedirect.com/science/article/pii/S1877750323002168} |
|
|
|
}
|
|
|
|
```
|
|
|
|
|
|
|
|
# Travelling Salesman Problem with Circle Placement (TSP-CP)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
# Dubins Travelling Salesman Problem with Circle Placement (DTSP-CP) |
|
|
\ No newline at end of file |
