Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.03.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036433802 / rank | |||
Normal rank | |||
Revision as of 20:35, 19 March 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
