A simple LP relaxation for the asymmetric traveling salesman problem (Q378136): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: H. S. Yoon / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6225220 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subtour elimination linear program relaxation | |||
Property / zbMATH Keywords: subtour elimination linear program relaxation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
extreme solutions | |||
Property / zbMATH Keywords: extreme solutions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
traveling salesman problem | |||
Property / zbMATH Keywords: traveling salesman problem / rank | |||
Normal rank |
Revision as of 11:04, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple LP relaxation for the asymmetric traveling salesman problem |
scientific article |
Statements
A simple LP relaxation for the asymmetric traveling salesman problem (English)
0 references
11 November 2013
0 references
subtour elimination linear program relaxation
0 references
extreme solutions
0 references
traveling salesman problem
0 references