Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370): 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.1016/j.disopt.2011.05.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2068748054 / rank | |||
Normal rank |
Revision as of 19:10, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices |
scientific article |
Statements
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (English)
0 references
5 April 2012
0 references
traveling salesman problem
0 references
2-matching
0 references
approximation algorithm
0 references