A new bound for the ratio between the 2-matching problem and its linear programming relaxation (Q1968794)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new bound for the ratio between the 2-matching problem and its linear programming relaxation |
scientific article; zbMATH DE number 1419750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new bound for the ratio between the 2-matching problem and its linear programming relaxation |
scientific article; zbMATH DE number 1419750 |
Statements
A new bound for the ratio between the 2-matching problem and its linear programming relaxation (English)
0 references
22 June 2000
0 references
2-matching
0 references
traveling salesman problem
0 references
subtour elimination problem
0 references
polyhedral combinatorics
0 references
0.8283582329750061
0 references
0.8247973918914795
0 references
0.8089333176612854
0 references
0.8057219386100769
0 references
