A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 638585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program |
scientific article; zbMATH DE number 638585 |
Statements
A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (English)
0 references
13 September 1994
0 references
minimum cost perfect 2-matching
0 references
weighted undirected graph
0 references
multiplier adjustment approach
0 references
traveling salesman
0 references
0 references
0 references
0.8247973918914795
0 references
0.8236321806907654
0 references
0.7981314063072205
0 references
0.7917162179946899
0 references
