A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:25, 10 July 2024
scientific article; zbMATH DE number 7812583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the balanced traveling salesman problem |
scientific article; zbMATH DE number 7812583 |
Statements
A branch-and-cut algorithm for the balanced traveling salesman problem (English)
0 references
4 March 2024
0 references
traveling salesman problem
0 references
balanced optimization
0 references
mixed-integer programming
0 references
branch-and-cut
0 references
