The family traveling salesman problem with incompatibility constraints (Q6065853): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.22036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3142352709 / rank | |||
Normal rank | |||
Revision as of 10:41, 30 July 2024
scientific article; zbMATH DE number 7775498
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
