|
|
|
This repository contains algorithms and datasets 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)**.
|
|
|
|
This repository contains algorithms and datasets 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)**.
|
|
|
|
|
|
|
|
This wiki contains instructions on installation and example usage.
|
|
|
|
For further assistance, you can contact the maintainer: [wolledav@cvut.cz](wolledav@cvut.cz)
|
|
|
|
|
|
|
|
# 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)*.
|
| ... | ... | |
