Title of article
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is image-complete Original Research Article
Author/Authors
Gerardo Berbeglia، نويسنده , , Ge?a Hahn، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
2541
To page
2547
Abstract
Deciding whether or not a feasible solution to the Traveling Salesman Problem with Pickups and Deliveries (TSPPD) exists is polynomially solvable. We prove that counting the number of feasible solutions of the TSPPD is hard by showing that the problem is image-complete.
Keywords
Traveling salesman problem with pickups and deliveries , Counting solutions , #P#P-complete , Complexity
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887188
Link To Document