Travelling Salesman Problem with a Center
<|reference_start|>Travelling Salesman Problem with a Center: We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA) we show that such a problem has a transition point that separates two phases differing in the scaling behaviour of $L$ and $C$, in efficiency of SA, and in the shape of minimal paths.<|reference_end|>
@article{lipowski2004travelling,
    title={Travelling Salesman Problem with a Center},
    author={Adam Lipowski and Dorota Lipowska},
    journal={Phys. Rev. E 71, 067701 (2005)},
    year={2004},
    doi={10.1103/PhysRevE.71.067701},
    archivePrefix={arXiv},
    eprint={cond-mat/0404424},
    primaryClass={cond-mat.stat-mech cs.CC}
}