A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381): 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.1007/s10878-023-01097-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4377223525 / rank | |||
Normal rank | |||
Revision as of 08:24, 30 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
