An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.34.5.698 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.34.5.698 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066558813 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.34.5.698 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:46, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems |
scientific article |
Statements
An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (English)
0 references
1986
0 references
branch-and-bound
0 references
Multiple traveling salesman problem
0 references
Lagrangean relaxation
0 references
degree-constrained minimal spanning tree
0 references
subgradient optimization
0 references
sensitivity analysis
0 references
