Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach (Q3037137): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/03155986.1983.11731885 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W108694910 / rank | |||
Normal rank | |||
Latest revision as of 21:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach |
scientific article |
Statements
Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach (English)
0 references
1983
0 references
generalized travelling salesman problem
0 references
shortest Hamiltonian cycle
0 references
integer linear program
0 references
degree constraints
0 references
subtour elimination
0 references
branch and bound algorithm
0 references
computational results
0 references
