Achieving feasibility for clustered traveling salesman problems using PQ‐trees (Q6139372)
From MaRDI portal
scientific article; zbMATH DE number 7780322
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Achieving feasibility for clustered traveling salesman problems using PQ‐trees |
scientific article; zbMATH DE number 7780322 |
Statements
Achieving feasibility for clustered traveling salesman problems using PQ‐trees (English)
0 references
18 December 2023
0 references
feasibility
0 references
graph theory
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
