The family traveling salesman problem with incompatibility constraints (Q6065853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7775498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The family traveling salesman problem with incompatibility constraints |
scientific article; zbMATH DE number 7775498 |
Statements
The family traveling salesman problem with incompatibility constraints (English)
0 references
11 December 2023
0 references
ant colony optimization algorithm
0 references
branch-and-cut algorithm
0 references
family traveling salesman problem
0 references
incompatibility constraints
0 references
iterated local search algorithm
0 references
network flows
0 references
valid inequalities
0 references
0.8505995869636536
0 references
0.7857205867767334
0 references
0.7138250470161438
0 references
0.7053303718566895
0 references
0.7000280022621155
0 references
