Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583)
From MaRDI portal
scientific article; zbMATH DE number 7709216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm |
scientific article; zbMATH DE number 7709216 |
Statements
Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (English)
0 references
10 July 2023
0 references
travelling salesman
0 references
integer programming
0 references
branch-and-cut algorithm
0 references
facet-inducing inequalities
0 references
polyhedral structure
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
