Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete |
scientific article; zbMATH DE number 5702569
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete |
scientific article; zbMATH DE number 5702569 |
Statements
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (English)
0 references
28 April 2010
0 references
traveling salesman problem with pickups and deliveries
0 references
counting solutions
0 references
\#\(P\)-complete
0 references
complexity
0 references
0 references
