Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:23, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete |
scientific article |
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
